Hop Independent Hop Domination in Graphs

Authors

  • Javier Hassan MSU-Iligan Institute of Technology, 9200, Iligan City, Philippines
  • Sergio Canoy, Jr. MSU-Iligan Institute of Technology

DOI:

https://doi.org/10.29020/nybg.ejpam.v15i4.4577

Keywords:

Hop Independent, Hop Domination

Abstract

Let G be an undirected graph with vertex and edge sets V (G) and E(G), respectively. A set S ⊆ V (G) is called a hop independent hop dominating set of G if S is both hop independent and hop dominating set of G. The minimum cardinality of hop independent hop dominating set of G, denoted by γhih(G), is called the hop independent hop domination number of G. In this paper, we show that the hop independent hop domination number of a graph G lies between the hop domination number and the hop independence number of graph G. We characterize these types of sets in the shadow graph, join, corona, and lexicographic product of two graphs. Moreover, either exact values or bounds of the hop independent hop domination numbers of these graphs are given.

Downloads

Published

2022-10-31

Issue

Vol. 15 No. 4: (October 2022)

Section

Nonlinear Analysis

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

Hop Independent Hop Domination in Graphs. (2022). European Journal of Pure and Applied Mathematics, 15(4), 1783-1796. https://doi.org/10.29020/nybg.ejpam.v15i4.4577