摘要
We offer a new method for proving that the maxima eigenvalue of the normalized graph Laplacian of a graph with n vertices is at least n+1/n−1 provided the graph is not complete and that equality is attained if and only if the complement graph is a single edge or a complete bipartite graph with both parts of size n−1/2.With the same method,we also prove a new lower bound to the largest eigenvalue in terms of the minimum vertex degree,provided this is at most n−1/2.
基金
Open access funding provided by Project DEAL.