Some Properties of Zero Forcing Hop Dominating Sets in a Graph
DOI:
https://doi.org/10.29020/nybg.ejpam.v17i1.4920Keywords:
Zero Forcing Hop Dominating set, zero forcing hop dominating numberAbstract
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.
Downloads
Published
Issue
Section
License
Copyright (c) 2024 European Journal of Pure and Applied Mathematics
![Creative Commons License](http://i.creativecommons.org/l/by-nc-sa/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Upon acceptance of an article by the journal, the author(s) accept(s) the transfer of copyright of the article to European Journal of Pure and Applied Mathematics.
European Journal of Pure and Applied Mathematics will be Copyright Holder.