𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bipartite graphs with small third Laplacian eigenvalue

✍ Scribed by Xiao-Dong Zhang

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
420 KB
Volume
278
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, all connected bipartite graphs are characterized whose third largest Laplacian eigenvalue is less than three. Moreover, the result is used to characterize all connected bipartite graphs with exactly two Laplacian eigenvalues not less than three, and all connected line graphs of bipartite graphs with the third eigenvalue of their adjacency matrices less than one.

πŸ“œ SIMILAR VOLUMES

Bipartite Distance-Regular Graphs with a
Bipartite Distance-Regular Graphs with an Eigenvalue of Multiplicity itk m
✍ Norio Yamazaki πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 194 KB

We show that, if a bipartite distance-regular graph of valency k has an eigenvalue of multiplicity k, then it becomes 2-homogeneous. Combined with a result on bipartite 2-homogeneous distance-regular graphs by K. Nomura, we have a classification of such graphs.

A sharp lower bound for the least eigenv
A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
✍ Domingos M. Cardoso; DragoΕ‘ CvetkoviΔ‡; Peter Rowlinson; Slobodan K. SimiΔ‡ πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 149 KB

We prove that the minimum value of the least eigenvalue of the signless Laplacian of a connected nonbipartite 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.