Double hop dominating sets in graphs
Keyword(s):
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.
2019 ◽
Vol 12
(4)
◽
pp. 1455-1463
Keyword(s):
Keyword(s):
2020 ◽
Vol 12
(04)
◽
pp. 2050052
◽
2017 ◽
Vol 09
(05)
◽
pp. 1750069
◽
Keyword(s):
2021 ◽
Vol 14
(3)
◽
pp. 1015-1023
Keyword(s):
2020 ◽
Vol 13
(1)
◽
pp. 170-179
Keyword(s):
2019 ◽
Vol 12
(3)
◽
pp. 1337-1349
Keyword(s):