Publicação
A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
| Resumo: | 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. |
|---|---|
| Autores principais: | Cardoso, D.M. |
| Outros Autores: | Cvetković, D.; Rowlinson, P.; Simić, S.K. |
| Assunto: | Graph spectra Least eigenvalue Control theory Bipartite graphs Line graph Signless Laplacian Unicyclic graphs Graph theory |
| Ano: | 2008 |
| País: | Portugal |
| Tipo de documento: | artigo |
| Tipo de acesso: | acesso restrito |
| Instituição associada: | Universidade de Aveiro |
| Idioma: | inglês |
| Origem: | RIA - Repositório Institucional da Universidade de Aveiro |
| Resumo: | 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. |
|---|