On the number of cycles in generalized Kautz digraphs

DOI10.1016/j.disc.2004.01.014zbMath1051.05055OpenAlexW1966565007MaRDI QIDQ1877656

Yosuke Kikuchi, Takeshi Mori, Yukio Shibata, Toru Hasunuma

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

Interconnection networksCountingCyclesGeneralized Kautz digraphs

Mathematics Subject Classification ID

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

Related Items (6)

On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs ⋮ The \(k\)-tuple twin domination in generalized de Bruijn and Kautz networks ⋮ 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 ⋮ Power domination in generalized undirected de Bruijn graphs and Kautz graphs

Cites Work

• Unnamed Item
• 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
• A Design for Directed Graphs with Minimum Diameter
• Connectivity of Imase and Itoh digraphs
• Design to Minimize Diameter on Building-Block Network
• Counting small cycles in generalized de Bruijn digraphs

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