Global Hop Domination Numbers of Graphs

Authors

  • Gemma Salasalan Mindanao State University - Iligan Institute of Technology
  • Sergio Canoy, Jr Mindanao State University - Iligan Institute of Technology

DOI:

https://doi.org/10.29020/nybg.ejpam.v14i1.3916

Keywords:

hop domination, global hop domination, join, corona, lexicographic product, and Cartesian product

Abstract

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. It is a global hop dominating set of G if it is a hop dominatingset of both G and the complement of G. The minimum cardinality of a global hop dominatingset of G, denoted by γgh(G), is called the global hop domination number of G. In this paper, we study the concept of global hop domination in graphs resulting from some binary operations.

 

Author Biographies

  • Gemma Salasalan, Mindanao State University - Iligan Institute of Technology
    Department of Mathematics and Statistics, PhD student
  • Sergio Canoy, Jr, Mindanao State University - Iligan Institute of Technology
    Department of Mathematics and Statistics, Professor

Downloads

Published

2021-01-31

Issue

Section

Nonlinear Analysis

How to Cite

Global Hop Domination Numbers of Graphs. (2021). European Journal of Pure and Applied Mathematics, 14(1), 112-125. https://doi.org/10.29020/nybg.ejpam.v14i1.3916