A Note on the Locating-Total Domination in Graphs
In this paper we obtain a sharp (improved) lower bound on the locating-total domination number of a graph, and show that the decision problem for the locating-total domination is NP-complete.
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2017-08-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1961 |