On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs

DOI10.1016/j.ins.2010.07.001zbMath1272.05153MaRDI QIDQ621581

Erfang Shan, Zeng-Rong Liu, Ling-Ye Wu

Publication date: 28 January 2011

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2010.07.001

zbMATH Keywords

interconnection networks; \(k\)-tuple domination; generalized Kautz digraph; generalized de Brujin digraph

Mathematics Subject Classification ID

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Related Items

On computing secure domination of trees, The \(k\)-tuple twin domination in generalized de Bruijn and Kautz networks, Bipolar fuzzy graphs, Efficient total domination in digraphs, On rainbow domination numbers of graphs, Finding minimum weight connected dominating set in stochastic graph based on learning automata, Independent rainbow domination of graphs, Dominating problems in swapped networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On reliability of the folded hypercubes
• Efficient algorithms for the minimum connected domination on trapezoid graphs
• The upper bound on \(k\)-tuple domination numbers of graphs
• The \(k\)-tuple domination number revisited
• Proof of a conjecture on \(k\)-tuple domination in graphs
• 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
• Edge-fault-tolerant bipanconnectivity of hypercubes
• The bipancycle-connectivity of the hypercube
• \(k\)-tuple domination in graphs
• Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
• The Hamiltonian property of generalized de Bruijn digraphs
• Counting closed walks in generalized de Bruijn graphs
• The bottleneck independent domination on the classes of bipartite graphs and block graphs.
• Algorithmic aspect of \(k\)-tuple domination in 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
• A generalised upper bound for the \(k\)-tuple domination number
• Bounds on the absorbant number of generalized Kautz digraphs
• Connectivity of Regular Directed Graphs with Small Diameters
• A Design for Directed Graphs with Minimum Diameter
• Generalized de Bruijn digraphs
• Design to Minimize Diameter on Building-Block Network