Abstract
For a graph G = (G(V), G(E)), algebraic connectivity a(G) >= 0 is the second smallest e-value (eigenvalue) of the Laplacian matrix of G. It is used......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
