From the 1 of 3 linked papers with an AI index.
3 papers
math.CO2026
Claw-free cubic graphs and zero forcing
Jorge Lozano, Shahla Nasserasr, Thomas Wall
The paper investigates the zero forcing number of claw‑free cubic graphs, resolves three open questions, characterizes those graphs where the zero forcing number equals the indepen…
math.CO2024
Colourings of -coloured mixed graphs
Gary MacGillivray, Shahla Nasserasr, Feiran Yang
A mixed graph is, informally, an object obtained from a simple undirected graph by choosing an orientation for a subset of its edges. A mixed graph is -coloured if each edg…
math.CO2024
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(\…