Counting closed walks in generalized de Bruijn graphs

DOI10.1016/0020-0190(94)90090-6zbMath0792.05063OpenAlexW2036527661MaRDI QIDQ1318762

Miyuki Shirahata, Yukio Shibata, Shingo Osawa

Publication date: 5 April 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)90090-6

zbMATH Keywords

countingde Bruijn graphclosed walks

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

On the number of cycles in generalized Kautz digraphs ⋮ Bounds on the number of closed walks in a graph and its applications ⋮ On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs ⋮ New bounds on the decycling number of generalized de Bruijn digraphs ⋮ Distance domination of generalized de Bruijn and Kautz digraphs ⋮ The \(k\)-tuple twin domination in generalized de Bruijn and Kautz networks ⋮ The twin domination number in generalized de Bruijn digraphs ⋮ Constructing the minimum dominating sets of generalized de Bruijn digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• A Design for Directed Graphs with Minimum Diameter
• Generalized de Bruijn digraphs
• Design to Minimize Diameter on Building-Block Network

This page was built for publication: Counting closed walks in generalized de Bruijn graphs