Article ID Journal Published Year Pages File Type
9512402 Discrete Mathematics 2005 11 Pages PDF
Abstract
(3) Let G be a simple connected bipartite graph with vertices v1,v2,…,vn and their degrees d1,d2,…,dn. Thenμ(G)⩾2+1m∑vi∼vj,i
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
Authors
, ,