科研之友
微信
新浪微博
Facebook
分享链接
摘要
Let G be a connected simple graph whose Laplacian eigenvalues are 0 = mu(n) (G) <= mu(n-1) (G) <= ... <= mu(1) (G). In this paper, we establish some upper and lower bounds for the algebraic connectivity and the largest Laplacian eigenvalue of G.
- 出版日期2012-7
