Skip to main content
Article thumbnail
Location of Repository

Cycles in the cycle prefix digraph

By F. Comellas and M. Mitjana

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

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.664
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://upcommons.upc.edu/e-pri... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.