Restrained 2-Resolving Hop Domination in Graphs
-
Published:2023-01-29
Issue:1
Volume:16
Page:286-303
-
ISSN:1307-5543
-
Container-title:European Journal of Pure and Applied Mathematics
-
language:
-
Short-container-title:Eur. J. Pure Appl. Math.
Author:
Mahistrado Angelica Mae,Rara Helen
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.
Publisher
New York Business Global LLC
Subject
Applied Mathematics,Geometry and Topology,Numerical Analysis,Statistics and Probability,Algebra and Number Theory,Theoretical Computer Science
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. 2-Locating Sets in a Graph;European Journal of Pure and Applied Mathematics;2023-07-30
2. $1$-movable $2$-Resolving Hop Domination in Graph;European Journal of Pure and Applied Mathematics;2023-07-30
3. Outer-Connected 2-Resolving Hop Domination in Graphs;European Journal of Pure and Applied Mathematics;2023-04-30