Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4647830 | Discrete Mathematics | 2013 | 7 Pages |
Abstract
In this paper, we determine the graph whose least eigenvalue of the signless Laplacian attains the minimum or maximum among all connected non-bipartite graphs of fixed order and given number of pendant vertices. Thus we obtain a lower bound and an upper bound for the least eigenvalue of the signless Laplacian of a graph in terms of the number of pendant vertices.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Yi-Zheng Fan, Yi Wang, Huan Guo,