Resolving Restrained Domination in Graphs
Let G be a connected graph. Brigham et al.  defined a resolving dominating set
as 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.
Upon acceptance of an article by the journal, the author(s) accept(s) the transfer of copyright of the article to European Journal of Pure and Applied Mathematics.Â
European Journal of Pure and Applied Mathematics will be Copyrihgt Holder.
If necessary, authors are responsible for obtaining permissions to reprint previously published figures, tables, and other material.