In this paper we obtain a sharp (improved) lower bound on the locatingtotal domination number of a graph, and show that the decision problem for the locating-total domination is NP-complete.
A locating-dominating set (LDS) of a graph G is a dominating set S of G such that for every two vertices u andis the minimum cardinality of a LDS of G. Further if S is a total dominating set then S is called a locating-total dominating set. In this paper we determine the domination, total domination, locating-domination and locating-total domination numbers for hypertrees and sibling trees.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.