Zero Forcing Domination in Some Graphs: Characterizations and Derived Formulas
DOI:
https://doi.org/10.29020/nybg.ejpam.v17i4.5154Keywords:
Zero forcing set, zero forcing dominating set, zero forcing domination numberAbstract
In this paper, we initiate the study on zero forcing domination in a graph and we characterize the zero forcing dominating sets in some special graphs and the join of two graphs. We derive some formulas of the parameter using characterization results. Moreover, we present some relationships of this parameter with other known parameters in graph theory.
Downloads
Published
Issue
Section
License
Copyright (c) 2024 Javier Hassan, Maria Andrea O. Bonsocan, Mercedita A. Langamin, Vergel T. Bilar, Sharifa Dianne A. Aming, Bayah J. Amiruddin-Rajik
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.