| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654198 | European Journal of Combinatorics | 2010 | 8 Pages |
Abstract
Let GG be a simple connected graph with nn vertices and nn edges which we call a unicyclic graph. In this paper, we first investigate the least eigenvalue λn(G)λn(G), then we present two sharp bounds on the spread s(G)s(G) of GG.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Yarong Wu, Jinlong Shu,