Connected \(k\)-tuple twin domination in de Bruijn and Kautz digraphs

DOI10.1016/j.disc.2009.05.031zbMath1210.05092OpenAlexW2115265299MaRDI QIDQ1045016

Toru Araki

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.05.031

zbMATH Keywords

line digraphKautz digraphde Bruijn digraph1-factorizationsconnected \(k\)-tuple twin dominating set

Mathematics Subject Classification ID

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

Related Items (2)

Partitioning vertices into in- and out-dominating sets in digraphs ⋮ On the \((h,k)\)-domination numbers of iterated line digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum connected dominating sets and maximal independent sets in unit disk graphs
• Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem
• The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
• Construction of strongly connected dominating sets in asymmetric multihop wireless networks
• \(k\)-tuple domination in graphs
• Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
• Algorithmic aspect of \(k\)-tuple domination in graphs.
• On the \(k\)-tuple domination of de Bruijn and Kautz digraphs
• On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
• New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
• Characterizations of trees with equal paired and double domination numbers

This page was built for publication: Connected \(k\)-tuple twin domination in de Bruijn and Kautz digraphs