On the number of cycles in generalized Kautz digraphs

DOI10.1016/J.DISC.2004.01.014MaRDI QIDQ1877656zbMATH OpenOpenAlexFDO

Authors Toru Hasunuma, Yosuke Kikuchi, Takeshi Mori, Yukio Shibata

Publication date 19 August 2004

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2004.01.014

zbMATH Keywords

CountingCyclesGeneralized Kautz digraphsInterconnection networks

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30) Paths and cycles (05C38) Congruences; primitive roots; residue systems (11A07)

Recommendations

• scientific article; zbMATH DE number 2051080
• Counting small cycles in generalized de Bruijn digraphs
• New cyclic Kautz digraphs with optimal diameter
• On the decycling number of generalized Kautz digraphs
• Large generalized cycles

Cites work

• A Design for Directed Graphs with Minimum Diameter
• Connectivity of Imase and Itoh digraphs
• Connectivity of Regular Directed Graphs with Small Diameters
• Counting closed walks in generalized de Bruijn graphs
• Counting small cycles in generalized de Bruijn digraphs
• Design to Minimize Diameter on Building-Block Network
• scientific article; zbMATH DE number 51878 (Why is no real title available?)
• On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs

Cited in

(11)

• On the number of cycles of short length in the de Bruijn-Good graph \(G_ n\)
• Counting pure \(k\)-cycles in sequences of Cayley graphs
• Bounds on the absorbant number of generalized Kautz digraphs
• Twin domination in generalized Kautz digraphs
• On the twin domination number in generalized de Bruijn and generalized Kautz digraphs
• The k-tuple twin domination in generalized de Bruijn and Kautz networks
• Counting small cycles in generalized de Bruijn digraphs
• scientific article; zbMATH DE number 2051080 (Why is no real title available?)
• On the decycling number of generalized Kautz digraphs
• Power domination in generalized undirected de Bruijn graphs and Kautz graphs
• On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs

This page was built for publication: On the number of cycles in generalized Kautz digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1877656)