Show simple item record

dc.contributor.authorComellas Padró, Francesc de Paula
dc.contributor.authorMitjana Riera, Margarida
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada I
dc.date.accessioned2007-04-30T08:48:41Z
dc.date.available2007-04-30T08:48:41Z
dc.date.created2000
dc.date.issued2000
dc.identifier.urihttp://hdl.handle.net/2117/805
dc.description.abstractCycle prefix digraphs are a class of Cayley coset graphs with many remarkable properties such as symmetry, large number of nodes for a given degree and diameter, simple shortest path routing, Hamiltonicity, optimal connectivity, and others. In this paper we show that the cycle prefix digraphs, like the Kautz digraphs, contain cycles of all lengths l, with l between two and N, the order of the digraph, except for N-1.
dc.format.extent11
dc.language.isoeng
dc.rightsAttribution-NonCommercial-NoDerivs 2.5 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/2.5/es/
dc.subject.lcshGraph theory
dc.subject.othercycle prefix digraph
dc.titleCycles in the cycle prefix digraph
dc.typeArticle
dc.subject.lemacGrafs, Teoria de
dc.contributor.groupUniversitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.subject.amsClassificació AMS::05 Combinatorics::05C Graph theory
dc.rights.accessOpen Access
local.personalitzacitaciotrue


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 2.5 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 2.5 Spain