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

How to Cite

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

Issue

Vol. 16 No. 1: (January 2023)

Section

Nonlinear Analysis

License

Copyright (c) 2023 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 journal, the author(s) accept(s) the transfer of copyright of the article to European Journal of Pure and Applied Mathematics.

European Journal of Pure and Applied Mathematics will be Copyright Holder.