Resolving Restrained Domination in Graphs
2021 ◽
Vol 14
(3)
◽
pp. 829-841
Keyword(s):
Let G be a connected graph. Brigham et al. [3] defined a resolving dominating setas a set S of vertices of a connected graph G that is both resolving and dominating. A set S ⊆ V (G) is a resolving restrained dominating set of G if S is a resolving dominating set of G and S = V (G) or hV (G) \ Si has no isolated vertex. In this paper, we characterize the resolving restrained dominating sets in the join, corona and lexicographic product of graphs and determine the resolving restrained domination number of these graphs.
2021 ◽
Vol 14
(3)
◽
pp. 1015-1023
Keyword(s):
2018 ◽
Vol 11
(05)
◽
pp. 1850075
2019 ◽
Vol 12
(4)
◽
pp. 1410-1425
2021 ◽
Vol 14
(3)
◽
pp. 803-815
2017 ◽
Vol 48
(1)
◽
pp. 61-71
◽
Keyword(s):
2021 ◽
Vol 14
(2)
◽
pp. 578-589