Abstract
A set \( D \subseteq V_{G} \) of a graph \( G = (V_{G},E_{G}) \) is called a global total k-dominating set of G if D is a total k-dominating set of both G and \( \overline{G} \), the complement of G. The Minimum Global Total k-Domination problem is to find a global total k-dominating set of minimum cardinality of the input graph G and Decide Global Total k-Domination problem is the decision version of Minimum Global Total k-Domination problem. The Decide Global Total k -Domination problem is known to be NP-complete for general graphs. In this paper, we study the complexity of the Minimum Global Total k-Domination problem. We show the Decide Global Total k-Domination problem remains NP-complete for bipartite graphs and chordal graphs. Next, we show that the Minimum Global Total k-Domination problem admits a constant approximation algorithm for bounded degree graphs. Finally, we show that the Minimum Global Total k-Domination problem is APX-complete for bounded degree graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and their Approximability Properties. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-58412-1
Bermudo, S., MartÃnez, A.C., Mira, F.A.H., Sigarreta, J.M.: On the global total k-domination number of graphs. Discrete Appl. Math. 263, 42–50 (2019)
Fulkerson, D., Gross, O.: Incidence matrices and interval graphs. Pac. J. Math. 15(3), 835–855 (1965)
Haynes, T., Hedetniemi, S., Slater, P.: Domination in Graphs: Advanced Topics. Marcel Dekker Inc., New York (1998)
Haynes, T., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. Marcel Dekker Inc., New York (1998)
Henning, M.A.: A survey of selected recent results on total domination in graphs. Discrete Math. 309(1), 32–63 (2009)
Henning, M.A., Kazemi, A.P.: k-tuple total domination in graphs. Discrete Appl. Math. 158(9), 1006–1011 (2010)
Henning, M.A., Yeo, A.: Total Domination in Graphs. Springer, New York (2013). https://doi.org/10.1007/978-1-4614-6525-6
Pradhan, D.: Algorithmic aspects of k-tuple total domination in graphs. Inf. Process. Lett. 112(21), 816–822 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Panda, B.S., Goyal, P. (2020). Hardness Results of Global Total k-Domination Problem in Graphs. In: Changat, M., Das, S. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2020. Lecture Notes in Computer Science(), vol 12016. Springer, Cham. https://doi.org/10.1007/978-3-030-39219-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-030-39219-2_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-39218-5
Online ISBN: 978-3-030-39219-2
eBook Packages: Computer ScienceComputer Science (R0)