\(k\)-tuple total domination in graphs

DOI10.1016/j.dam.2010.01.009zbMath1210.05097MaRDI QIDQ708327

Michael A. Henning, Adel P. Kazemi

Publication date: 11 October 2010

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

Full work available at URL: https://doi.org/10.1016/j.dam.2010.01.009

zbMATH Keywords

total domination; \(k\)-tuple total domination

Mathematics Subject Classification ID

05C65: Hypergraphs

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

Related Items

On the algorithmic complexity of \(k\)-tuple total domination, \(k\)-tuple total domination in complementary prisms, Algorithmic aspects of \(k\)-tuple total domination in graphs, \(k\)-tuple total domination in cross products of graphs, Hardness results and approximation algorithm for total liar's domination in graphs, On upper bounds for multiple domination numbers of graphs, Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs, \(k\)-tuple total restrained domination in complementary prisms, Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs, COMPLEXITY OF CERTAIN FUNCTIONAL VARIANTS OF TOTAL DOMINATION IN CHORDAL BIPARTITE GRAPHS

Cites Work

• \(k\)-tuple domination in graphs
• Small transversals in hypergraphs
• Algorithmic aspect of \(k\)-tuple domination in graphs.
• Some remarks on domination
• On Double Domination in Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item