Well-forced graphs
Combinatorics
2023-12-25 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2312.14298,
title = {Well-forced graphs},
author = {Cheryl Grood and Ruth Haas and Bonnie Jacob and Erika King and Shahla Nasserasr},
journal= {arXiv preprint arXiv:2312.14298},
year = {2023}
}