Hop Differentiating Hop Dominating Sets in Graphs


  • Sergio Canoy, Jr.
  • Chrisley Jade Saromines Mindanao State University - Iligan Institute of Technology




Hop domination, Join, corona and lexicographic product


A subset S of V (G), where G is a simple undirected graph, is hop dominating if for each v ∈ V (G) \ S, there exists w ∈ S such that dG(v, w) = 2 and it is hop differentiating if N2 G[u] ∩ S ̸= N2 G[v] ∩ S for any two distinct vertices u, v ∈ V (G). A set S ⊆ V (G) is hop differentiating hop dominating if it is both hop differentiating and hop dominating in G. The minimum cardinality of a hop differentiating hop dominating set in G, denoted by γdh(G), is called the hop differentiating hop domination number of G. In this paper, we investigate some properties of this newly defined parameter. In particular, we characterize the hop differentiating hop dominating sets in graphs under some binary operations.






Nonlinear Analysis

How to Cite

Hop Differentiating Hop Dominating Sets in Graphs. (2023). European Journal of Pure and Applied Mathematics, 16(1), 440-453. https://doi.org/10.29020/nybg.ejpam.v16i1.4673

Similar Articles

1-10 of 197

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

Most read articles by the same author(s)