Counting small cycles in generalized de Bruijn digraphs

DOI10.1002/(SICI)1097-0037(199701)29:1%3C39::AID-NET4%3E3.0.CO;2-DMaRDI QIDQ4345572zbMATH OpenOpenAlexFDO

Authors Toru Hasunuma, Yukio Shibata

Publication date 23 July 1997

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199701)29:1%3C39::aid-net4%3E3.0.co;2-d

zbMATH Keywords

generalized de Bruijn digraphsmall cycles

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• On the number of cycles of short length in the de Bruijn-Good graph \(G_ n\)
• On the number of cycles in generalized Kautz digraphs
• scientific article; zbMATH DE number 2051080
• Counting closed walks in generalized de Bruijn graphs
• Large generalized cycles

Cited in

(15)

• On the number of cycles of short length in the de Bruijn-Good graph \(G_ n\)
• Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs
• Counting closed walks in generalized de Bruijn graphs
• Distance domination of generalized de Bruijn and Kautz digraphs
• On the number of cycles in generalized Kautz digraphs
• Constructing the minimum dominating sets of generalized de Bruijn digraphs
• Hamiltonicity of large generalized de Bruijn cycles
• The k-tuple twin domination in generalized de Bruijn and Kautz networks
• Radial Moore graphs of radius three
• scientific article; zbMATH DE number 2051080 (Why is no real title available?)
• New bounds on the decycling number of generalized de Bruijn digraphs
• scientific article; zbMATH DE number 1827742 (Why is no real title available?)
• Independent spanning trees with small depths in iterated line digraphs
• Particular cycles of a binary de Bruijn digraph
• The twin domination number in generalized de Bruijn digraphs

This page was built for publication: Counting small cycles in generalized de Bruijn digraphs

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