Author:
Manditong Jahiri,Tapeing Aziz,Hassan Javier,Bakkang Alcyn R.,Mohommad Nurijam Hanna M.,Kamdon Sisteta U.
Abstract
In this paper, we initiate the study of a zero forcing hop domination in a graph. We establish some properties of this parameter and we determine its connections with other known parameters in graph theory. Moreover, we obtain some exact values or bounds of the parameter on the generalized graph, some families of graphs, and graphs under some operations via characterizations.
Publisher
New York Business Global LLC
Cited by
5 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