1 citations · 1 across the 3 of their papers we have counts for
4 papers
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…
Unavoidable Induced Subgraph of Infinite 2-connected Graphs
Sarah Allred, Guoli Ding, Bogdan Oporowski
In 1930, Ramsey proved that every infinite graph contains either an infinite clique or an infinite independent set as an induced subgraph. König proved that every infinite graph co…
A combinatorial bound on the number of distinct eigenvalues of a graph
Sarah Allred, Craig Erickson, Kevin Grace +2
The smallest possible number of distinct eigenvalues of a graph , denoted by , has a combinatorial bound in terms of unique shortest paths in the graph. In particular, $q(…
Unavoidable Induced Subgraphs of Large 2-Connected Graphs
Sarah Allred, Guoli Ding, Bogdan Oporowski
Ramsey proved that for every positive integer , every sufficiently large graph contains an induced or . Among the many extensions of Ramsey's Theorem there…