Connected hop domination in graphs under some binary operations
2018 ◽
Vol 11
(05)
◽
pp. 1850075
Keyword(s):
Let [Formula: see text] be a simple graph. A hop dominating set [Formula: see text] is called a connected hop dominating set of [Formula: see text] if the induced subgraph [Formula: see text] of [Formula: see text] is connected. The smallest cardinality of a connected hop dominating set of [Formula: see text], denoted by [Formula: see text], is called the connected hop domination number of [Formula: see text]. In this paper, we characterize the connected hop dominating sets in the join, corona and lexicographic product of graphs and determine the corresponding connected hop domination number of these graphs. The study of these concepts is motivated with a social network application.
2021 ◽
Vol 14
(3)
◽
pp. 803-815
2019 ◽
Vol 12
(3)
◽
pp. 1337-1349
Keyword(s):
2019 ◽
Vol 12
(4)
◽
pp. 1643-1655
Keyword(s):
2021 ◽
Vol 14
(3)
◽
pp. 829-841
2021 ◽
Vol 14
(3)
◽
pp. 1015-1023
Keyword(s):
2020 ◽
Vol 12
(05)
◽
pp. 2050066
2017 ◽
Vol 48
(1)
◽
pp. 61-71
◽
Keyword(s):
2021 ◽
Vol 14
(2)
◽
pp. 578-589
2019 ◽
Vol 12
(01)
◽
pp. 2050008
◽
Keyword(s):