On the global total $k$-domination number of graphs

DOI10.1016/j.dam.2018.05.025zbMath1414.05216OpenAlexW2886863269MaRDI QIDQ2420407

F. A. Hernández-Mira, José María Sigarreta-Almira, Sergio Bermudo, Abel Cabrera Martínez

Publication date: 6 June 2019

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

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

zbMATH Keywords

total \(k\)-dominationglobal total dominationglobal total \(k\)-domination

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Global total \(k\)-domination: approximation and hardness results ⋮ Hardness results of global total \(k\)-domination problem in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the total \(k\)-domination in graphs
• Total \(k\)-domination in Cartesian product graphs
• The total global domination number of a graph
• Complexity of Total {k}-Domination and Related Problems

This page was built for publication: On the global total $k$-domination number of graphs