Abstract
AbstractDenote the Laplacian of a graph by and its second smallest Laplacian eigenvalue by . If is a graph on vertices, then it is shown that the second smallest eigenvalue of is at least 1, where is the complement of the second power of . As a corollary of this result, it is shown that
where is the number of vertices of eccentricity at least 3 in .
Subject
Geometry and Topology,Discrete Mathematics and Combinatorics
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献