Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
From MaRDI portal
(Redirected from Publication:929482)
Recommendations
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 3972894 (Why is no real title available?)
- Lower bounds for the spread of a matrix
- On the spread of a hermitian matrix and a conjecture of thompson
- Some results on the index of unicyclic graphs
- The eigenvalue spreads of a hermitian matrix and its principal submatrices
- The spread of a matrix
- The spread of the spectrum of a graph
- The spread of unicyclic graphs with given size of maximum matchings
Cited in
(50)- On the least eigenvalue of cacti with pendant vertices
- On least eigenvalues of bicyclic graphs with fixed number of pendant vertices
- An edge-rotating theorem on the least eigenvalue of graphs
- The Laplacian spread of unicyclic 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
- The minimum Laplacian spread of unicyclic graphs
- On the distance spread of cacti and bicyclic graphs
- The spread of unicyclic graphs with given size of maximum matchings
- Further results on the least eigenvalue of connected graphs
- Spectral conditions for the existence of specified paths and cycles in graphs
- On the eigenvalues of firefly graphs
- On the largest eigenvalue of signed unicyclic graphs
- The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices
- 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
- A lower bound for the algebraic connectivity of a graph in terms of the domination number
- The least eigenvalue of graphs with cut edges
- On the least eigenvalues of unbalanced signed bicyclic graphs with given girth
- Graph Limits and Spectral Extremal Problems for Graphs
- Ordering unicyclic graphs in terms of their smaller least eigenvalues
- Minimizing the least eigenvalue of unbalanced signed unicyclic graphs with given girth or pendant vertices
- The signless Laplacian spread
- Bounds on the eigenvalues of graphs with cut vertices or edges
- The least eigenvalue of signless Laplacian of graphs under perturbation
- The eccentricity spread of weak-friendship graphs
- On the least distance eigenvalue of a graph
- Minimizing the least eigenvalue of unicyclic graphs with fixed diameter
- The spread of the unicyclic graphs
- Minimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\))
- Least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices
- Cacti whose spread is maximal
- The least eigenvalues of integral circulant graphs
- The least eigenvalue of the complements of trees
- The Laplacian spread of quasi-tree graphs
- Bicyclic graphs for which the least eigenvalue is minimum
- 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
- Spectra of signed graphs
- Maximizing the least signless Laplacian eigenvalue of unicyclic graphs
- The \(A_\alpha\)-spread of a graph
- Maximizing the largest eigenvalues of signed unicyclic graphs
- On the spectral spread of bicyclic graphs with given girth
- Bound on the least eigenvalue of a graph with cut vertices
- \(A_\alpha\)-spectrum of a firefly graph
- Spectral properties of a class of unicyclic graphs
This page was built for publication: Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q929482)