Further results on secure restrained domination in graphs

2016 ◽  
Vol 19 (2) ◽  
pp. 277-291 ◽  
Author(s):  
P. Roushini Leely Pushpam ◽  
Chitra Suseendran
2013 ◽  
Vol 7 (1) ◽  
pp. 26
Author(s):  
Zahra Tahmasbzadehbaee ◽  
D Soner Nandappa ◽  
Hossein Abdollahzadeh Ahangar ◽  
Doost Ali Mojdeh ◽  
Yancai Zhao

2020 ◽  
pp. 1-14
Author(s):  
Michael A. Henning ◽  
Adel P. Kazemi

2015 ◽  
Vol 9 (2) ◽  
pp. 239-247 ◽  
Author(s):  
P. Roushini Leely Pushpam ◽  
Chitra Suseendran

2005 ◽  
Vol 55 (1) ◽  
pp. 165-173 ◽  
Author(s):  
De-Xiang Ma ◽  
Xue-Gang Chen ◽  
Liang Sun

2021 ◽  
Vol 14 (3) ◽  
pp. 829-841
Author(s):  
Gerald Bacon Monsanto ◽  
Helen M. Rara

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.


Sign in / Sign up

Export Citation Format

Share Document