On Restrained Strong Resolving Domination in Graphs
Keywords:restrained strong resolving dominating set, restrained strong resolving domination number, join, corona, lexicographic product
A set S âŠ† V (G) is a restrained strong resolving dominating set in G if S is a strong
resolving dominating set in G and S = V (G) or âŸ¨V (G) \ SâŸ© has no isolated vertex. The restrained strong resolving domination number of G, denoted by Î³rsR(G), is the smallest cardinality of a restrained strong resolving dominating set in G. In this paper, we present characterizations of the restrained strong resolving dominating sets in the join, corona and lexicographic product of two graphs and determine the exact value of the restrained strong resolving domination number of each of these graphs.
How to Cite
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 Copyright Holder.