Open AccessOn Resolving Hop Domination in Graphs
Author(s) -
Jerson Mohamad,
Helen M. Rara
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.v14i3.4055
Subject(s) - mathematics , dominating set , lexicographical order , combinatorics , domination analysis , vertex (graph theory) , hop (telecommunications) , discrete mathematics , graph , computer science , telecommunications
A set S of vertices in a connected graph G is a resolving hop dominating set of G if S is a resolving set in G and for every vertex v ∈ V (G) \ S there exists u ∈ S such that dG(u, v) = 2. The smallest cardinality of such a set S is called the resolving hop domination number of G. This paper presents the characterizations of the resolving hop dominating sets in the join, corona and lexicographic product of two graphs and determines the exact values of their corresponding resolving hop domination number.