𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sharp bounds for the largest eigenvalue of the signless Laplacian of a graph

✍ Scribed by Yanqing Chen; Ligong Wang

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
194 KB
Volume
433
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A sharp upper bound on the largest Lapla
A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs
✍ Kinkar Ch. Das; R.B. Bapat πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 217 KB

We consider weighted graphs, where the edge weights are positive definite matrices. The Laplacian of the graph is defined in the usual way. We obtain an upper bound on the largest eigenvalue of the Laplacian and characterize graphs for which the bound is attained. The classical bound of Anderson and

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.