A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph

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. © 2008 Elsevier Inc. All rights...

Full description

Bibliographic Details
Main Author: Cardoso, D.M. (author)
Other Authors: Cvetković, D. (author), Rowlinson, P. (author), Simić, S.K. (author)
Format: article
Language:eng
Published: 1000
Subjects:
Graph spectra
Least eigenvalue
Control theory
Bipartite graphs
Line graph
Signless Laplacian
Unicyclic graphs
Graph theory
Online Access:http://hdl.handle.net/10773/4256
Country:Portugal
Oai:oai:ria.ua.pt:10773/4256
Description
Summary: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. © 2008 Elsevier Inc. All rights reserved.

Similar Items