Hardness results of global total \(k\)-domination problem in graphs

DOI10.1016/J.DAM.2021.02.018zbMath1494.05089OpenAlexW3131142066WikidataQ113877250 ScholiaQ113877250MaRDI QIDQ5918768

B. S. Panda, Pooja Goyal

Publication date: 4 August 2022

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

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

zbMATH Keywords

NP-completenessdominationAPX-completeness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamentals of parameterized complexity
• Algorithmic aspects of \(k\)-tuple total domination in graphs
• \(k\)-tuple total domination in graphs
• Approximation hardness of dominating set problems in bounded degree graphs
• A survey of selected recent results on total domination in graphs
• Incidence matrices and interval graphs
• On the global total $k$-domination number of graphs
• Total Domination in Graphs
• Analytical approach to parallel repetition
• Hardness results of global total \(k\)-domination problem in graphs

This page was built for publication: Hardness results of global total \(k\)-domination problem in graphs