A Variant of Hop Domination in Graphs

Authors

  • Sergio Canoy, Jr. MSU-Iligan Institute of Technology, 9200 Iligan City, Philippines
  • Gemma Puebla Salasalan Mindanao State University - Iligan Institute of Technology

DOI:

https://doi.org/10.29020/nybg.ejpam.v15i2.4352

Keywords:

hop domination, super hop domination, complement-super domination, join, lexicographic product

Abstract

Let G be a 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. A set S ⊆ V (G) is a super hop dominating set if ehpnG(v, V (G) \ S) ≠ ∅ for
each v ∈ V (G) \ S, where ehpnG(v, V (G) \ S) is the set containing all the external hop private neighbors of v with respect to V (G) \ S. The minimum cardinality of a super hop dominating set of G, denoted by γsh(G), is called the super hop domination number of G. In this paper, we investigate the concept and study it for graphs resulting from some binary operations. Specifically, we characterize the super hop dominating sets in the join, and lexicographic products of graphs, and determine bounds of the super hop domination number of each of these graphs.

Downloads

Published

2022-04-30

Issue

Vol. 15 No. 2: (April 2022)

Section

Topology

License

Copyright (c) 2022 European Journal of Pure and Applied Mathematics

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.

By agreeing to this statement, you acknowledge that:

  • You retain full copyright over your work.
  • The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
  • This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.

How to Cite

A Variant of Hop Domination in Graphs. (2022). European Journal of Pure and Applied Mathematics, 15(2), 342-353. https://doi.org/10.29020/nybg.ejpam.v15i2.4352