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.
@article{bwmeta1.element.doi-10_7151_dmgt_1961, author = {Mirka Miller and R. Sundara Rajan and R. Jayagopal and Indra Rajasingh and Paul Manuel}, title = {A Note on the Locating-Total Domination in Graphs}, journal = {Discussiones Mathematicae Graph Theory}, volume = {37}, year = {2017}, pages = {745-754}, language = {en}, url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_7151_dmgt_1961} }
Mirka Miller; R. Sundara Rajan; R. Jayagopal; Indra Rajasingh; Paul Manuel. A Note on the Locating-Total Domination in Graphs. Discussiones Mathematicae Graph Theory, Tome 37 (2017) pp. 745-754. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_7151_dmgt_1961/