.png){kind=icon}
.png){kind=icon}
Return
Zero Forcing on 2-connected Outerplanar Graphs
.png){kind=icon}
PRE
AI
DOI：10.1007/s00373-026-03045-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We determine upper and lower bounds on the zero forcing number of 2-connected outerplanar graphs in terms of the structure of the weak dual. We show that the upper bound is always at most half the number of vertices in the graph. This result generalizes work of Hern & aacute;ndez, Ranilla and Ranilla-Cortina in [4] who proved a similar result for maximal outerplanar graphs.
Keywords:
Zero forcing
Outerplanar graph
2-connected
Journal
G
IF:
0.6
Papers:
80
Citations:
0
