Year: 2024
Type: article
Abstract: 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.
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
Funder: Korea University
OpenAlex ID: W4403934323
