Restrained 2-Resolving Hop Domination in Graphs

Authors

  • Angelica Mae Mahistrado MSU-IIT
  • Helen Rara MSU-IIT

DOI:

https://doi.org/10.29020/nybg.ejpam.v16i1.4665

Keywords:

restrained 2-resolving hop dominating set, restrained 2-resolving hop domination number, join, corona, edge corona, lexicographic product

Abstract

Let G be a connected graph. A set S ⊆ V (G) is a restrained 2-resolving hop dominating set of G if S is a 2-resolving hop dominating set of G and S = V (G) or ⟨V (G)\S⟩ has no isolated vertex. The restrained 2-resolving hop domination number of G, denoted by γr2Rh(G) is the smallest cardinality of a restrained 2-resolving hop dominating set of G. This study aims to combine the concept of hop domination with the restrained 2-resolving sets of graphs. The main results generated in this study include the characterization of restrained 2-resolving hop dominating sets in the join, corona, edge corona and lexicographic product of graphs, as well as their corresponding bounds or exact values.

Downloads

Published

2023-01-29

Issue

Section

Nonlinear Analysis

How to Cite

Restrained 2-Resolving Hop Domination in Graphs. (2023). European Journal of Pure and Applied Mathematics, 16(1), 286-303. https://doi.org/10.29020/nybg.ejpam.v16i1.4665