Domination Parameters in Hypertrees and Sibling trees

Indra Rajasingh, R. Jayagopal, R. Sundara Rajan

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)\setminus S$, $N(u)\cap S\ne N(v)\cap S$. The…