Minimizing the least eigenvalue of graphs with fixed order and size

DOI10.1016/j.disc.2012.03.033zbMath1245.05086OpenAlexW1991902547MaRDI QIDQ442311

Aneta Sawikowska, Charles R. Johnson

Publication date: 10 August 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.03.033

zbMATH Keywords

bipartite graphadjacency matrixminimum eigenvaluesingular valuePerron rootsingle additional row matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Special matrices (15B99)

Related Items (1)

A note on connected bipartite graphs of fixed order and size with maximal index

Uses Software

• mftoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Gangster operators and invincibility of positive semidefinite matrices
• Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
• Bounds on graph eigenvalues
• Graphs for which the least eigenvalue is minimal. I
• On the first eigenvalue of bipartite graphs
• Lower bounds on the spectra of symmetric matrices with nonnegative entries
• Eigenvalues and expanders
• Matrix Analysis
• Max cut and the smallest eigenvalue
• Functions of Matrices

This page was built for publication: Minimizing the least eigenvalue of graphs with fixed order and size