\(k\)-tuple total domination in graphs
From MaRDI portal
Publication:708327
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
05C65: Hypergraphs
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Signed total double Roman k-domination in graphs, Unnamed Item, A note on the \(k\)-tuple total domination number of a graph, New bounds on the signed total domination number of graphs, 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, Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs, Domination parameters with number 2: interrelations and algorithmic consequences, A note on domination and total domination in prisms, Total \(k\)-domination in Cartesian product graphs, \(k\)-tuple total domination in cross products of graphs, Hardness results and approximation algorithm for total liar's domination in graphs, Domination on hyperbolic graphs, New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs, The complexity of finding harmless individuals in social networks, Total $k$-domination in strong product 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, Total limited packing in graphs, Graphs of Large Linear Size Are Antimagic, 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
