Connected Grundy Hop Dominating Sequences in Graphs
-
Published:2023-04-30
Issue:2
Volume:16
Page:1212-1227
-
ISSN:1307-5543
-
Container-title:European Journal of Pure and Applied Mathematics
-
language:
-
Short-container-title:Eur. J. Pure Appl. Math.
Author:
Hassan Javier,Canoy, Jr. Sergio R.
Abstract
In this paper, we introduce and do an initial investigation of a variant of Grundy hop domination in a graph called the connected Grundy hop domination. We show that the connected Grundy hop domination number lies between the connected hop domination and Grundy hop domination number of a graph. In particular, we give realization results involving connected hop domination, connected Grundy hop domination, and Grundy hop domination numbers. Moreover, we determine the connected Grundy hop domination numbers of some graphs.
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
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. 2-distance Zero Forcing Sets in Graphs;European Journal of Pure and Applied Mathematics;2024-04-30
2. Certified Vertex Cover of a Graph;European Journal of Pure and Applied Mathematics;2024-04-30
3. Formulas and Properties of 2-Hop Domination in Some Graphs;European Journal of Pure and Applied Mathematics;2024-04-30
4. Legal Hop Independent Sequences in Graphs;European Journal of Pure and Applied Mathematics;2024-04-30
5. J-Domination in Graphs;European Journal of Pure and Applied Mathematics;2023-10-30