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$,...

Full description

Bibliographic Details
Main Authors: N. Jafari Rad, A. Poureidi
Format: Article
Published: Azarbaijan Shahide Madani University 2019-12-01
Series:Communications in Combinatorics and Optimization
Online Access:http://comb-opt.azaruniv.ac.ir/article_13874_62d388aaf42e0893e140772d7fa34403.pdf