Header menu link for other important links
Domination parameters in hypertrees and sibling trees
, , R. Sundara Rajan
Published in Elsevier BV
Volume: 280
Pages: 237 - 245
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. © 2020 Elsevier B.V.
About the journal
JournalData powered by TypesetDiscrete Applied Mathematics
PublisherData powered by TypesetElsevier BV
Open AccessYes