Open AccessGlobal Hop Domination Numbers of Graphs
Author(s) -
Gemma Puebla Salasalan,
Sergio R. Canoy
Publication year - 2021
Publication title -
european journal of pure and applied mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.245
H-Index - 5
ISSN - 1307-5543
DOI - 10.29020/nybg.ejpam.v14i1.3916
Subject(s) - mathematics , dominating set , hop (telecommunications) , domination analysis , combinatorics , complement (music) , discrete mathematics , graph , vertex (graph theory) , computer science , computer network , biochemistry , chemistry , complementation , gene , phenotype
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.Â