Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
