2 citations · 4 across the 7 of their papers we have counts for
1 paper · 2 filters
George Brooks, William Linz, Linyuan Lu
The spread of a graph G is the difference λ1−λn between the largest and smallest eigenvalues of its adjacency matrix. Breen, Riasanovsky, Tait and Urschel recently determin…