Zero Forcing Domination in Some Graphs: Characterizations and Derived Formulas
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.
Authors
- Mercedita A. Langamin
- Javier Hassan
- Bayah Amiruddin-Rajik (ORCID: https://orcid.org/0000-0001-7678-6669)
- Maria Andrea O. Bonsocan
- Sharifa Dianne A. Aming
- Vergel T. Bilar
Publication Details
- Journal
- European Journal of Pure and Applied Mathematics
- Published
- 2024-10-31
- DOI
- https://doi.org/10.29020/nybg.ejpam.v17i4.5154
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Korea University