Hop Dominating Sets in Graphs Under Binary Operations
DOI:
https://doi.org/10.29020/nybg.ejpam.v12i4.3550Keywords:
domination, hop domination, join, corona, and lexicographic productAbstract
Let G be a (simple) connected graph with vertex and edge sets V (G) and E(G),
respectively. A set S ⊆ V (G) is a hop dominating set of G if for each v ∈ V (G) \ S, there exists w ∈ S such that dG(v, w) = 2. The minimum cardinality of a hop dominating set of G, denoted by γh(G), is called the hop domination number of G. In this paper we revisit the concept of hop domination, relate it with other domination concepts, and investigate it in graphs resulting from some binary operations.
Downloads
Published
2019-10-31
Issue
Section
Nonlinear Analysis
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.
How to Cite
Hop Dominating Sets in Graphs Under Binary Operations. (2019). European Journal of Pure and Applied Mathematics, 12(4), 1455-1463. https://doi.org/10.29020/nybg.ejpam.v12i4.3550