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

DOI10.1016/j.ipl.2007.05.010zbMath1183.05029OpenAlexW1968689466MaRDI QIDQ2380002

Toru Araki

Publication date: 24 March 2010

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.05.010

zbMATH Keywords

interconnection networksKautz digraphde Bruijn digraph\(k\)-tuple domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (13)

Identifying codes on directed de Bruijn graphs ⋮ On the domination number of $t$-constrained de Bruijn graphs ⋮ On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs ⋮ Distance domination of generalized de Bruijn and Kautz digraphs ⋮ The \(k\)-tuple twin domination in generalized de Bruijn and Kautz networks ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Efficient twin domination in generalized de Bruijn digraphs ⋮ Twin domination in generalized Kautz digraphs ⋮ ON THE TWIN DOMINATION NUMBER IN GENERALIZED DE BRUIJN AND GENERALIZED KAUTZ DIGRAPHS ⋮ The twin domination number in generalized de Bruijn digraphs ⋮ The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs ⋮ Connected \(k\)-tuple twin domination in de Bruijn and Kautz digraphs ⋮ Constructing the minimum dominating sets of generalized de Bruijn digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Diameter, short paths and superconnectivity in digraphs
• On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
• \(k\)-tuple domination in graphs
• Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
• Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks
• Super link-connectivity of iterated line digraphs.
• Factorization of de Bruijn digraphs by cycle-rooted trees
• Independence number of iterated line digraphs
• Algorithmic aspect of \(k\)-tuple domination in graphs.
• Extension of de Bruijn graph and Kautz graph
• The bondage numbers of extended de Bruijn and Kautz digraphs
• Line Digraph Iterations and the (d, k) Digraph Problem
• A Design for Directed Graphs with Minimum Diameter
• Design to Minimize Diameter on Building-Block Network
• Completely independent spanning trees in the underlying graph of a line digraph

This page was built for publication: On the \(k\)-tuple domination of de Bruijn and Kautz digraphs