2019/01/23 by Rajasingh, Indra, Jayagopal, R., Rajan, R. Sundara
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1901.07735
A locating-dominating set (LDS) of a graph G is a dominating set S of G such that for every two vertices u and v in V(G) ∖ S, N(u)∩ S ≠ N(v)∩ S. The locating-domination number γL(G) is 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.