Failed 2-Distance Zero Forcing in Graphs

Authors

  • Al-Fadzri Madjatul MSU-Tawi-Tawi College of Technology and Oceanography
  • Javier Hassan
  • Maria Andrea O. Bonsocan
  • Vergel T. Bilar

DOI:

https://doi.org/10.29020/nybg.ejpam.v18i3.6544

Keywords:

failed 2-distance zero forcing, failed 2-distance zero forcing number, co-zero forcing set, co-zero forcing number

Abstract

Let $G$ be a graph with vertex and edge-sets $E(G)$ and $V(G)$, respectively. Then $M\subset V(G)$ is called a failed 2-distance zero forcing set of $G$ if $M$ is not a 2-distance zero forcing set of $G$. The failed 2-distance zero forcing number of a graph $G$, denoted by $F^2(G)$, is the maximum cardinality of a failed 2-distance zero forcing set. In this paper, we introduce the said parameter and study this on some graphs and on the join of two graphs. Moreover, we define the failed co-zero forcing concept to characterize the failed 2-distance zero forcing sets in the join of two graphs, and finally derive the formulas for solving the exact values of the parameter.

Downloads

Published

2025-08-02

Issue

Section

Discrete Mathematics

How to Cite

Failed 2-Distance Zero Forcing in Graphs. (2025). European Journal of Pure and Applied Mathematics, 18(3), 6544. https://doi.org/10.29020/nybg.ejpam.v18i3.6544