Double hop dominating sets in graphs
Reynaldo Villarobe Mollejon, Sergio R. Canoy · Discrete Mathematics Algorithms and Applications · 2020
Let [Formula: see text] be a connected graph of order [Formula: see text]. A subset [Formula: see text] is a double hop dominating set (or a double [Formula: see text]-step dominating set) if [Formula: see text], where [Formula: see text], for each [Formula: see text]. The smallest cardinality of a double hop dominating set of [Formula: see text], denoted by [Formula: see text], is the double hop domination number of [Formula: see text]. In this paper, we investigate the concept of double hop dominating sets and study it for graphs resulting from some binary operations.