Diameter vs. Laplacian eigenvalue distribution (Q6908599)

For a graph \(G\) of order \(n\), any Laplacian eigenvalue of \(G\) lies in the interval [0, \(n\)]. For an interval \(I\subseteq [0, n]\), denote by \(m_{G}I\) the number of Laplacian eigenvalues of \(G\) in \(I\), counted with multiplicities. Let \(d\) be the diameter of \(G\). For \(2\leq d \leq n-4\), the authors show that \(m_G[n-d, n]\leq n-d+2\), and it may be improved into \(m_G[n-d, n]\leq n-d+1\) when \(d = 2, 3, 4\). It is also shown that \(m_G[n-2d+4, n]\leq n-2\) if \(d = 2, \lfloor (n+3)/2\rfloor\) and \(m_G[n-2d+4, n]\leq n-3\) if \(3\leq d \leq \lfloor (n+1)/2\rfloor\).