Well-forced graphs

Well-forced graphs

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2023-12
Hauptverfasser: Grood, Cheryl, Haas, Ruth, Jacob, Bonnie, King, Erika, Nasserasr, Shahla
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Apexes
Trees (mathematics)
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:2331-8422