\(k\)-tuple total domination in graphs
From MaRDI portal
Publication:708327
DOI10.1016/j.dam.2010.01.009zbMath1210.05097OpenAlexW2113467420MaRDI 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
Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (40)
New bounds on the signed total domination number of graphs ⋮ A new approach on locally checkable problems ⋮ COMPLEXITY OF CERTAIN FUNCTIONAL VARIANTS OF TOTAL DOMINATION IN CHORDAL BIPARTITE GRAPHS ⋮ From Italian domination in lexicographic product graphs to w-domination in graphs ⋮ Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs ⋮ Cartesian product graphs and k-tuple total domination ⋮ \(k\)-tuple total domination in cross products of graphs ⋮ Domination parameters with number 2: interrelations and algorithmic consequences ⋮ On the algorithmic complexity of \(k\)-tuple total domination ⋮ On the double total dominator chromatic number of graphs ⋮ Total $k$-domination in strong product graphs ⋮ From \(w\)-domination in graphs to domination parameters in lexicographic product graphs ⋮ \(k\)-tuple total domination in complementary prisms ⋮ On upper bounds for total k-domination number via the probabilistic method ⋮ A note on domination and total domination in prisms ⋮ Domination on hyperbolic graphs ⋮ On the domination of triangulated discs ⋮ Total \(k\)-domination in Cartesian product graphs ⋮ Algorithmic aspects of \(k\)-tuple total domination in graphs ⋮ On upper bounds for multiple domination numbers of graphs ⋮ Global total \(k\)-domination: approximation and hardness results ⋮ Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs ⋮ \(k\)-tuple total restrained domination in complementary prisms ⋮ k-tuple restrained domination in graphs ⋮ Hardness results of global total \(k\)-domination problem in graphs ⋮ Hardness results and approximation algorithm for total liar's domination in graphs ⋮ Graphs of Large Linear Size Are Antimagic ⋮ A note on the \(k\)-tuple total domination number of a graph ⋮ Domination for Latin square graphs ⋮ Total limited packing in graphs ⋮ Signed total double Roman k-domination in graphs ⋮ Multiple Domination ⋮ Unnamed Item ⋮ Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs ⋮ 3-tuple total domination number of Rook's graphs ⋮ New bounds on the double total domination number of graphs ⋮ Roman k-tuple domination number of a graph ⋮ New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs ⋮ The complexity of finding harmless individuals in social networks ⋮ A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs
Cites Work
This page was built for publication: \(k\)-tuple total domination in graphs
