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: | Miller Mirka, Rajan R. Sundara, Jayagopal R., Rajasingh Indra, Manuel Paul |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2017-08-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1961 |
Similar Items
-
Bounds on the Locating-Total Domination Number in Trees
by: Wang Kun, et al.
Published: (2020-02-01) -
Bounds on the Locating-Domination Number and Differentiating-Total Domination Number in Trees
by: Rad Nader Jafari, et al.
Published: (2018-05-01) -
Locating and Total Dominating Sets in Trees
by: Haynes, Teresa W., et al.
Published: (2006) -
Locating and Total Dominating Sets in Trees.
by: Howard, Jamie Marie
Published: (2004) -
Optimal Locating-Total Dominating Sets in Strips of Height 3
by: Junnila Ville
Published: (2015-08-01)