On a lower bound for the Laplacian eigenvalues of a graph
If μm and dm denote, respectively, the m-th largest Laplacian eigenvalue and the m-th largest vertex degree of a graph, then μm⩾dm−m+2. This inequality was conjectured by Guo (Linear Multilinear Algebra 55:93–102, 2007) and proved by Brouwer and Haemers (Linear Algebra Appl 429:2131–2135, 2008). Bro...
Saved in:
Main Authors: | Greaves, Gary Royden Watson, Munemasa, Akihiro, Peng, Anni |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/144996 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Graphs with three eigenvalues and second largest eigenvalue at most 1
by: Cheng, Xi-Ming, et al.
Published: (2020) -
Laplacian and signless-laplacian energies of closed shadow graphs
by: Sung, Inseok
Published: (2022) -
On Laplacian centrality of a graph: An exposition
by: Inguillo, Margaret C.
Published: (2023) -
Augmenting the Delsarte bound: a forbidden interval for the order of maximal cliques in strongly regular graphs
by: Greaves, Gary Royden Watson, et al.
Published: (2022) -
Toward the optimization of normalized graph Laplacian
by: Xie, B., et al.
Published: (2013)