2 citations · 3 across the 17 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.CO2021
The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph
Shaun M. Fallat, H. Tracy Hall, Jephian C. -H. Lin +1
The inverse eigenvalue problem of a graph studies the real symmetric matrices whose off-diagonal pattern is prescribed by the adjacencies of the graph. The strong spectral property…
math.CO2021
A zero forcing technique for bounding sums of eigenvalue multiplicities
Franklin H. j. Kenter, Jephian C. -H. Lin
Given a graph , one may ask: "What sets of eigenvalues are possible over all weighted adjacency matrices of ?" (The weight of an edge is positive or negative, while the diago…