Power domination in generalized undirected de Bruijn graphs and Kautz graphs
From MaRDI portal
Publication:5245856
DOI10.1142/S1793830915500032zbMath1309.05136OpenAlexW1983440503MaRDI QIDQ5245856
Publication date: 15 April 2015
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830915500032
Applications of graph theory (05C90) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Cites Work
- On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
- A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs
- On connectivity of consecutive-\(d\) digraphs
- On the number of cycles in generalized Kautz digraphs
- A Design for Directed Graphs with Minimum Diameter
- Design to Minimize Diameter on Building-Block Network
- Domination in Graphs Applied to Electric Power Networks
This page was built for publication: Power domination in generalized undirected de Bruijn graphs and Kautz graphs