On the third largest eigenvalue of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- Bipartite graphs with at most six non-zero eigenvalues
- Characterization of graphs with exactly two non-negative eigenvalues
- Cospectrality of complete bipartite graphs
- On the third largest eigenvalue of a graph
- The distribution of eigenvalues of graphs
Cited in
(27)- On the distribution of eigenvalues of graphs
- Cospectrality of multipartite graphs
- Edge connectivity, packing spanning trees, and eigenvalues of graphs
- The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5
- A complete characterization of graphs with exactly two positive eigenvalues
- Graphs with three distinct eigenvalues and largest eigenvalue less than 8
- Distance spectral radius of complete multipartite graphs and majorization
- Extremizing first eigenvalue of 3-colored digraphs made with given blocks
- On the spectral determinations of the connected multicone graphs \(K_r \nabla sK_t\)
- LOWER BOUNDS FOR ENERGY OF MATRICES AND ENERGY OF REGULAR GRAPHS
- On claw-free graphs with all but four eigenvalues equal to \(0\) or \(-1\)
- Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs
- A relation between the signless Laplacian spectral radius of complete multipartite graphs and majorization
- On graphs with exactly two positive eigenvalues
- On the Seidel Estrada index of graphs
- New type bounds for energy of graphs and spread of matrices
- Non-bipartite graphs with third largest Laplacian eigenvalue less than three
- Energy of graphs with no eigenvalue in the interval \((-1,1)\)
- A new lower bound for the energy of graphs
- Reverse Wiener spectral radius of trees
- On the eigenvalues and spectral radius of starlike trees
- On the third largest eigenvalue of a graph
- Majorization and the spectral radius of starlike trees
- scientific article; zbMATH DE number 6116782 (Why is no real title available?)
- The vertex connectivity and the third largest eigenvalue in regular (multi-)graphs
- Graphs with three eigenvalues and second largest eigenvalue at most 1
- Chromatic number and signless Laplacian spectral radius of graphs
This page was built for publication: On the third largest eigenvalue of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q277140)