Article ID Journal Published Year Pages File Type
4949713 Discrete Applied Mathematics 2017 16 Pages PDF
Abstract
Let λ2(G) be the second smallest normalized Laplacian eigenvalue of a graph G. In this paper, we determine all trees with λ2(T)≥1−32. Meanwhile, if T is a tree of diameter 6, then we prove that λ2(T)≤1−32. Moreover, we determine all trees of diameter d=3 or 6 with λ2(T)=1−32.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
, ,