The \(q\)-Analogue of Zero Forcing for Certain Families of Graphs

Zero forcing is a combinatorial game played on a graph with the ultimate goal of changing the colour of all the vertices at minimal cost. Originally this game was conceived as a one player game, but later a two-player version was devised in-conjunction with studies on the inertia of a graph, and has...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2023-06
Hauptverfasser:	Fallat, Shaun, Joshi, Neha, Maleki, Roghayeh, Meagher, Karen, Seyed Ahmad Mojallal, Nasserasr, Shahla, Shirazi, Mahsa N, Razafimahatratra, Andriaherimanana Sarobidy, Stevens, Brett
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Combinatorial analysis Games Graphs Trees (mathematics)
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!