On Hop Roman Domination in Trees
Let $G=(V,E)$ be a graph. A subset $S\subset V$ is a hop dominating set if every vertex outside $S$ is at distance two from a vertex of $S$. A hop dominating set $S$ which induces a connected subgraph is called a connected hop dominating set of $G$. The connected hop domination number of $G$,...
Azarbaijan Shahide Madani University
|Series:||Communications in Combinatorics and Optimization |