On least eigenvalues of bicyclic graphs with fixed number of pendant vertices
From MaRDI portal
Publication:690534
DOI10.1007/s10958-012-0738-yzbMath1254.05107MaRDI QIDQ690534
Publication date: 28 November 2012
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-012-0738-y
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs for which the least eigenvalue is minimal. I
- Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
- Graphs for which the least eigenvalue is minimal. II.
- Minimizing the least eigenvalue of unicyclic graphs with fixed diameter
- The least eigenvalue of a graph with cut vertices
- The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph
- Bicyclic graphs for which the least eigenvalue is minimum
- The least eigenvalue of graphs with given connectivity
- The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices
- Sharp lower bounds of the least eigenvalue of planar graphs
- A surprising property of the least eigenvalue of a graph
- On graphs whose least eigenvalue exceeds \(-1-\sqrt2\)
- The spectral radius of trees on \(k\) pendant vertices
- Bounds of eigenvalues of a graph