On Resolving Hop Domination in Graphs
A set S of vertices in a connected graph G is a resolving hop dominating set of G if S is a resolving set in G and for every vertex v âˆˆ V (G) \ S there exists u âˆˆ S such that dG(u, v) = 2. The smallest cardinality of such a set S is called the resolving hop domination number of G. This paper presents the characterizations of the resolving hop dominating sets in the join, corona and lexicographic product of two graphs and determines the exact values of their corresponding resolving hop domination number.
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.