Scholarlink

<p>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ández, Ranilla and Ranilla-Cortina in [<CitationRef CitationID="CR4">4</CitationRef>] who proved a similar result for maximal outerplanar graphs.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Zero Forcing on 2-connected Outerplanar Graphs

  • 期刊论文

  • 发表日期：

    2026年5月11日

查看全文
  • Nolan Ison,
  • Mark Kempton,
  • Franklin Kenter

摘要

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ández, Ranilla and Ranilla-Cortina in [4] who proved a similar result for maximal outerplanar graphs.