Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4603282 | Linear Algebra and its Applications | 2008 | 11 Pages |
Abstract
We prove that the minimum value of the least eigenvalue of the signless Laplacian of a connected non-bipartite graph with a prescribed number of vertices is attained solely in the unicyclic graph obtained from a triangle by attaching a path at one of its endvertices.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory