Eigenvalue comparisons in graph theory
Let \(G\) be a finite graph with minimal degree \(k\), and \(\lambda_1\geq\lambda_2\geq\cdots\geq\lambda_n\) be its spectrum. In this paper, some lower bounds for the first eigenvalues \(\lambda_i\), in terms of \(k\) and the diameter of \(G\), are derived.
scientific article; zbMATH DE number 1025794