Hop Differentiating Hop Dominating Sets in Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v16i1.4673Keywords:
Hop domination, Join, corona and lexicographic productAbstract
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.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 European Journal of Pure and Applied Mathematics

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
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.