Well-forced graphs

Cheryl Grood,Ruth Haas,Bonnie Jacob, Erika King,Shahla Nasserasr

arxiv（2023）

引用 0|浏览1

暂无评分

摘要

A graph in which all minimal zero forcing sets are in fact minimum size is called ``well-forced." This paper characterizes well-forced trees and presents an algorithm for determining which trees are well-forced. Additionally, we characterize which vertices in a tree are contained in no minimal zero forcing set.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要