Published in

Elsevier, Linear Algebra and its Applications, 11-12(429), p. 2770-2780, 2008

DOI: 10.1016/j.laa.2008.05.017

Links

Tools

Export citation

Search in Google Scholar

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

Journal article published in 2008 by Domingos M. Cardoso ORCID, Dragos Cvetkovic, Peter Rowlinson, Slobodan K. Simic
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Orange circle
Postprint: archiving restricted
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

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.