Trees with small spectral gap
From MaRDI portal
Publication:3174804
DOI10.26493/1855-3974.992.68DzbMATH Open1391.05168OpenAlexW2760156479WikidataQ129389478 ScholiaQ129389478MaRDI QIDQ3174804FDOQ3174804
Publication date: 18 July 2018
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/1855-3974.992.68d
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Extremal problems in graph theory (05C35)
Cites Work
- More spectral bounds on the clique and independence numbers
- A sharp upper bound of the spectral radius of graphs
- Some Inequalities for the Largest Eigenvalue of a Graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the nullity of graphs with pendent vertices
- Walks and the spectral radius of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the index of caterpillars
- Inequalities for Graph Eigenvalues
Cited In (1)
This page was built for publication: Trees with small spectral gap
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174804)