A New Upper Bound for Laplacian Graph Eigenvalues
Let G = (V,E) be a graph with vertex set V = {l_brace}v{sub i},V{sub 2},...,v{sub n}{r_brace}. The degree of v{sub i} and the average degree of the adjacent vertices of v{sub i} are denoted by d{sub i} and m{sub v{sub i}}, respectively. In this paper, we prove that max {l_brace}(d{sub v}m{sub v}/d{sub u})+(d{sub u}m{sub u}/d{sub v}):uv(set-membership sign)E{r_brace} is an upper bound for the largest Laplacian eigenvalue of G, the equality holds if G is a d-regular bipartite graph.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗