A note on the complexity of locating-total domination in graphs
DOI10.1016/J.TCS.2019.09.039zbMath1436.68257OpenAlexW2978963472WikidataQ127195776 ScholiaQ127195776MaRDI QIDQ2333807
Publication date: 13 November 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.09.039
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Locating-total domination in graphs
- Locating-total domination in claw-free cubic graphs
- Bounds on the locating-total domination number of a tree
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- A note on the locating-total domination in graphs
- Locating and total dominating sets in trees
- On locating and differetiating-total domination in trees
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- Graph Classes: A Survey
- Total Domination in Graphs
This page was built for publication: A note on the complexity of locating-total domination in graphs