Geodetic Hop Dominating Sets in a Graph
-
Published:2023-01-29
Issue:1
Volume:16
Page:5-17
-
ISSN:1307-5543
-
Container-title:European Journal of Pure and Applied Mathematics
-
language:
-
Short-container-title:Eur. J. Pure Appl. Math.
Author:
Saromines Chrisley Jade,Canoy, Jr. Sergio
Abstract
Let G be an undirected graph with vertex and edge sets V (G) and E(G), respectively. A subset S of vertices of G is a geodetic hop dominating set if it is both a geodetic and a hop dominating set. The geodetic hop domination number of G, γhg(G), is the minimum cardinality among all geodetic hop dominating sets in G. Geodetic hop dominating sets in a graph resulting from some binary operations have been characterized. These characterizations have been used to determine some tight bounds for the geodetic hop domination number of each of the graphs considered.
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. On Minimal Geodetic Hop Domination in Graphs;European Journal of Pure and Applied Mathematics;2024-07-31
2. Closed Geodetic Hop Domination in Graphs;European Journal of Pure and Applied Mathematics;2024-07-31
3. Geodetic Roman Dominating Functions in a Graph;European Journal of Pure and Applied Mathematics;2023-10-30