2 papers
math.CO2026
Strictly Interlaced Spectral Data for the Weighted Matching Polynomial of a Graph
Shaun Fallat, Johnna Parenteau
Interlacing of the real roots of a weighted matching polynomial for a graph and that of a vertex-deleted subgraph is classical and well-known. In the context of strict interlac…
math.CO2024
Minimum number of distinct eigenvalues of distance-regular and signed Johnson graphs
Shaun Fallat, Himanshu Gupta, Allen Herman +1
We study the minimum number of distinct eigenvalues over a collection of matrices associated with a graph. Lower bounds are derived based on the existence or non-existence of certa…