Cycles in the cycle prefix digraph
dc.contributor.author | Comellas Padró, Francesc de Paula |
dc.contributor.author | Mitjana Riera, Margarida |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada I |
dc.date.accessioned | 2007-04-30T08:48:41Z |
dc.date.available | 2007-04-30T08:48:41Z |
dc.date.created | 2000 |
dc.date.issued | 2000 |
dc.identifier.uri | http://hdl.handle.net/2117/805 |
dc.description.abstract | Cycle 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.extent | 11 |
dc.language.iso | eng |
dc.rights | Attribution-NonCommercial-NoDerivs 2.5 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/2.5/es/ |
dc.subject.lcsh | Graph theory |
dc.subject.other | cycle prefix digraph |
dc.title | Cycles in the cycle prefix digraph |
dc.type | Article |
dc.subject.lemac | Grafs, Teoria de |
dc.contributor.group | Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
dc.subject.ams | Classificació AMS::05 Combinatorics::05C Graph theory |
dc.rights.access | Open Access |
local.personalitzacitacio | true |
Files in this item
This item appears in the following Collection(s)
-
Articles de revista [2.557]
-
Articles de revista [234]
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 2.5 Spain