Hardness results of global total k-domination problem in graphs
DOI10.1016/J.DAM.2021.02.018zbMATH Open1494.05089OpenAlexW3131142066WikidataQ113877250 ScholiaQ113877250MaRDI QIDQ5918768FDOQ5918768
Authors: 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
Recommendations
- Hardness results of global total \(k\)-domination problem in graphs
- Global total \(k\)-domination: approximation and hardness results
- On the global total $k$-domination number of graphs
- Complexity of Total {k}-Domination and Related Problems
- Algorithmic aspects of \(k\)-tuple total domination in graphs
Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Fundamentals of parameterized complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Incidence matrices and interval graphs
- Total domination in graphs
- A survey of selected recent results on total domination in graphs
- Title not available (Why is that?)
- \(k\)-tuple total domination in graphs
- Analytical approach to parallel repetition
- Approximation hardness of dominating set problems in bounded degree graphs
- Algorithmic aspects of \(k\)-tuple total domination in graphs
- On the global total $k$-domination number of graphs
- Hardness results of global total \(k\)-domination problem in graphs
Cited In (9)
- Global total \(k\)-domination: approximation and hardness results
- Hardness results of global Roman domination in graphs
- ``Global graph problems tend to be intractable
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs
- Hardness results of global total \(k\)-domination problem in graphs
- Algorithmic aspects of \(k\)-tuple total domination in graphs
- On the global total $k$-domination number of graphs
- Algorithm and hardness results on neighborhood total domination in graphs
- Some remarks on global total domination in graphs
This page was built for publication: Hardness results of global total \(k\)-domination problem in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5918768)
