Ordering unicyclic graphs in terms of their smaller least eigenvalues
From MaRDI portal
Publication:623640
DOI10.1155/2010/591758zbMath1204.05058OpenAlexW2121544754WikidataQ59253076 ScholiaQ59253076MaRDI QIDQ623640
Publication date: 8 February 2011
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/230410
Cites Work
- A table of connected graphs on six vertices
- Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
- The spread of the unicyclic graphs
- Lower bounds on the spectra of symmetric matrices with nonnegative entries
- Graph partitioning by eigenvectors
- Sharp lower bounds of the least eigenvalue of planar graphs
- On the two largest eigenvalues of trees
- Bounds of eigenvalues of a graph
- Graphs with least eigenvalue \(-2\); a historical survey and recent developments in maximal exceptional graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Ordering unicyclic graphs in terms of their smaller least eigenvalues