Grundy Dominating and Grundy Hop Dominating Sequences in Graphs: Relationships and Some Structural Properties
-
Published:2023-04-30
Issue:2
Volume:16
Page:1154-1166
-
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 revisit the concepts of Grundy domination and Grundy hop domination in graphs and give some realization results involving these parameters. We show that the Grundy domination number and Grundy hop domination number of a graph G are generally incomparable (one is not always less than or equal the other). It is shown that their absolute difference can be made arbitrarily large. Moreover, the Grundy domination numbers of some graphs are determined.
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
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. 2-distance Zero Forcing Sets in Graphs;European Journal of Pure and Applied Mathematics;2024-04-30
2. J-Open Independent Sets in Graphs;European Journal of Pure and Applied Mathematics;2024-04-30
3. Certified Vertex Cover of a Graph;European Journal of Pure and Applied Mathematics;2024-04-30
4. Formulas and Properties of 2-Hop Domination in Some Graphs;European Journal of Pure and Applied Mathematics;2024-04-30
5. Legal Hop Independent Sequences in Graphs;European Journal of Pure and Applied Mathematics;2024-04-30