Bicyclic graphs for which the least eigenvalue is minimum
From MaRDI portal
(Redirected from Publication:999810)
Recommendations
- Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
- On the spectral spread of bicyclic graphs with given girth
- The minimum Laplacian spread of unicyclic graphs
- scientific article; zbMATH DE number 5926156
- The least eigenvalue of unicyclic graphs with application to spectral spread
Cites work
- scientific article; zbMATH DE number 3882475 (Why is no real title available?)
- scientific article; zbMATH DE number 3972892 (Why is no real title available?)
- scientific article; zbMATH DE number 4043884 (Why is no real title available?)
- A table of connected graphs on six vertices
- Eigenspaces of graphs
- Graphs and combinatorics. Proceedings of the capital conference on graph theory and combinatorics at the George Washington University, June 18-22, 1973
- Graphs for which the least eigenvalue is minimal. I
- Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
- The largest eigenvalue of a graph: A survey
- The spectral radius of trees on \(k\) pendant vertices
- The spread of the spectrum of a graph
Cited in
(33)- On the least eigenvalue of cacti with pendant vertices
- On least eigenvalues of bicyclic graphs with fixed number of pendant vertices
- The minimax, maximin, and spread values for open neighborhood sums for 2-regular graphs
- Minimizing the least eigenvalue of bicyclic graphs with \(k\) pendant vertices.
- The spread of tetracyclic graphs
- The least eigenvalue of graphs whose complements have only two pendent vertices
- Minimal spread of integral circulant graphs
- The least eigenvalue of graphs whose complements are unicyclic
- Characterization of the minimizing graph of the connected graphs whose complements are bicyclic
- On the distance spread of cacti and bicyclic graphs
- Further results on the least eigenvalue of connected graphs
- Spectral conditions for the existence of specified paths and cycles in graphs
- Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
- The least eigenvalue of unicyclic graphs with application to spectral spread
- The least eigenvalue of a graph with a given domination number
- Maximum spread of \(K_{2,t}\)-minor-free graphs
- On the least eigenvalue of cacti
- On the maximum spread of planar and outerplanar graphs
- The least eigenvalue of graphs with cut edges
- Least eigenvalue of the connected graphs whose complements are cacti
- The signless Laplacian spread
- Minimizing graph of the connected graphs whose complements are bicyclic with two cycles
- Minimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\))
- Cacti whose spread is maximal
- A note on connected bipartite graphs of fixed order and size with maximal index
- The least eigenvalues of integral circulant graphs
- scientific article; zbMATH DE number 6007662 (Why is no real title available?)
- The least eigenvalue of the complements of trees
- 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
- Minimizing the least eigenvalue of bicyclic graphs with fixed diameter.
- On the spectral spread of bicyclic graphs with given girth
- Bound on the least eigenvalue of a graph with cut vertices
This page was built for publication: Bicyclic graphs for which the least eigenvalue is minimum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q999810)