1 citations · 2 across the 9 of their papers we have counts for
13 papers · 1 filter
Claw-free cubic graphs and zero forcing
Jorge Lozano, Shahla Nasserasr, Thomas Wall
A claw-free cubic graph is a cubic graph with no induced subgraph isomorphic to . The zero forcing process begins with an initial set of colored vertices. At each step…
Graphs with Bipartite Complement that Admit Two Distinct Eigenvalues
Wayne Barrett, Shaun Fallat, Veronika Furst +3
The parameter of an -vertex graph is the minimum number of distinct eigenvalues over the family of symmetric matrices described by . We show that all with $e(\…
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…