Open AccessResolving Restrained Domination in Graphs
Author(s) -
Gerald Bacon Monsanto,
Helen M. Rara
Publication year - 2021
Publication title -
european journal of pure and applied mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.245
H-Index - 5
ISSN - 1307-5543
DOI - 10.29020/nybg.ejpam.v14i3.3985
Subject(s) - dominating set , mathematics , lexicographical order , combinatorics , vertex (graph theory) , domination analysis , graph , discrete mathematics
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.