1 paper
Yuhan Guo, Dong Zhang
We show that for any connected graph G with maximum degree d≥3, the spectral gap from 0 with respect to the adjacency matrix is at most d−1, with equality if and o…