Strong Resolving Hop Domination in Graphs


  • Jerson Mohamad Western Mindanao State University
  • Helen Rara



strong resolving hop domination set, strong resolving hop domination number, hop dominated superclique, join, corona, lexicographic product


A vertex w in a connected graph G strongly resolves two distinct vertices u and v in V (G) if v is in any shortest u-w path or if u is in any shortest v-w path. A set W of vertices in G is a strong resolving set G if every two vertices of G are strongly resolved by some vertex of W. A set S subset of V (G) is a strong resolving hop dominating set of G if S is a strong 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 strong resolving hop domination number of G. This paper presents the characterization of the strong resolving hop dominating sets in the join, corona and lexicographic product of graphs. Furthermore, this paper determines the exact value or bounds of their corresponding strong resolving hop domination number.






Nonlinear Analysis

How to Cite

Strong Resolving Hop Domination in Graphs. (2023). European Journal of Pure and Applied Mathematics, 16(1), 131-143.

Similar Articles

1-10 of 560

You may also start an advanced similarity search for this article.

Most read articles by the same author(s)

1 2 > >>