On the number of cycles in generalized Kautz digraphs
From MaRDI portal
Publication:1877656
DOI10.1016/J.DISC.2004.01.014zbMATH Open1051.05055OpenAlexW1966565007MaRDI QIDQ1877656FDOQ1877656
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
Recommendations
Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30) Paths and cycles (05C38) Congruences; primitive roots; residue systems (11A07)
Cites Work
- Title not available (Why is that?)
- A Design for Directed Graphs with Minimum Diameter
- Design to Minimize Diameter on Building-Block Network
- On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
- Counting closed walks in generalized de Bruijn graphs
- Connectivity of Regular Directed Graphs with Small Diameters
- Connectivity of Imase and Itoh digraphs
- Counting small cycles in generalized de Bruijn digraphs
Cited In (9)
- Power domination in generalized undirected de Bruijn graphs and Kautz graphs
- Bounds on the absorbant number of generalized Kautz digraphs
- Twin domination in generalized Kautz digraphs
- The \(k\)-tuple twin domination in generalized de Bruijn and Kautz networks
- On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs
- Counting pure \(k\)-cycles in sequences of Cayley graphs
- On the twin domination number in generalized de Bruijn and generalized Kautz digraphs
- Title not available (Why is that?)
- On the number of cycles of short length in the de Bruijn-Good graph \(G_ n\)
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)
