On least eigenvalues of bicyclic graphs with fixed number of pendant vertices
From MaRDI portal
(Redirected from Publication:690534)
Cites work
- scientific article; zbMATH DE number 4043884 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- A surprising property of the least eigenvalue of a graph
- An introduction to the theory of graph spectra
- Bicyclic graphs for which the least eigenvalue is minimum
- Bounds of eigenvalues of a graph
- Eigenspaces of graphs
- Graphs for which the least eigenvalue is minimal. I
- Graphs for which the least eigenvalue is minimal. II.
- Minimizing the least eigenvalue of unicyclic graphs with fixed diameter
- Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
- On graphs whose least eigenvalue exceeds -1-2
- Sharp lower bounds of the least eigenvalue of planar graphs
- The least eigenvalue of a graph with cut vertices
- The least eigenvalue of graphs with given connectivity
- The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices
- The spectral radius of trees on \(k\) pendant vertices
- The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph
Cited in
(2)
This page was built for publication: On least eigenvalues of bicyclic graphs with fixed number of pendant vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690534)
