6 citations · 10 across the 14 of their papers we have counts for
5 papers · 1 filter
Well-forced graphs
Cheryl Grood, Ruth Haas, Bonnie Jacob +2
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 determini…
The -Analogue of Zero Forcing for Certain Families of Graphs
Shaun Fallat, Neha Joshi, Roghayeh Maleki +6
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 on…
Regular Graphs of Degree at most Four that Allow Two Distinct Eigenvalues
Wayne Barrett, Shaun Fallat, Veronika Furst +3
For an matrix , let be the number of distinct eigenvalues of . If is a connected graph on vertices, let be the set of all real sy…
The Strong Spectral Property of Graphs: Graph Operations and Barbell Partitions
Sarah Allred, Emelie Curl, Shaun Fallat +4
The utility of a matrix satisfying the Strong Spectral Property has been well established particularly in connection with the inverse eigenvalue problem for graphs. More recently t…
Spectral arbitrariness for trees fails spectacularly
Shaun M. Fallat, H. Tracy Hall, Rupert H. Levene +4
If is a graph and is an ordered multiplicity list which is realizable by at least one symmetric matrix with graph , what can we say about the eigenvalues of all…