The \(k\)-tuple twin domination in generalized de Bruijn and Kautz networks
From MaRDI portal
Publication:418321
DOI10.1016/j.camwa.2011.11.013zbMath1238.05203MaRDI QIDQ418321
Publication date: 28 May 2012
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2011.11.013
interconnection network; \(k\)-tuple twin domination; generalized de Bruijn network; generalized Kautz network
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
05C20: Directed graphs (digraphs), tournaments
Related Items
An optimal algorithm to find minimum k-hop dominating set of interval graphs, An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs, Distance domination of generalized de Bruijn and Kautz digraphs, Constructing the minimum dominating sets of generalized de Bruijn digraphs, Minimum 2-tuple dominating set of permutation graphs
Cites Work
- Unnamed Item
- On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs
- The twin domination number in generalized de Bruijn digraphs
- The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
- On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
- The Hamiltonian property of generalized de Bruijn digraphs
- On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
- Counting closed walks in generalized de Bruijn graphs
- On the number of cycles in generalized Kautz digraphs
- On the \(k\)-tuple domination of de Bruijn and Kautz digraphs
- Absorbant of generalized de Bruijn digraphs
- Connectivity of Regular Directed Graphs with Small Diameters
- ON THE TWIN DOMINATION NUMBER IN GENERALIZED DE BRUIJN AND GENERALIZED KAUTZ DIGRAPHS
- A Design for Directed Graphs with Minimum Diameter
- Generalized de Bruijn digraphs
- Connectivity of Imase and Itoh digraphs
- Design to Minimize Diameter on Building-Block Network
- Counting small cycles in generalized de Bruijn digraphs