On the third largest eigenvalue of a graph
For a graph \(G\) with \(n\) vertices and \(m\) edges, let the \(\lambda_k(G)\) \((k=1,\ldots,n)\) be the eigenvalues of \(G\)'s incidence matrix, ordered nonincreasingly. Several bounds are derived for these eigenvalues in case \(\lambda_3(G)<0\), among which \(\lambda_k(G)\geq -1\) for all \(k=3,\ldots,\lfloor (n+1)/2\rfloor\), \(\lambda_k(G)\leq -1\) for all \(k\geq (n+3)/2\), \(\lambda_n(G)\geq -1-\sqrt{n(n-1)/2-m}\), and when \(G=T\) is a tree not part of two special one-parameter families, \(\lambda_3(T)\geq 2\cos(3\pi/7)\), with equality only for \(T=P_6\).
- On the third largest eigenvalue of graphs
- The distribution of eigenvalues of graphs
- The third largest value of spectral radius of trees with \(n\) vertices and edge-independence number \(q\)
- On the \(k\)th largest eigenvalue of the Laplacian matrix of a graph
- Bounds of eigenvalues of \(K_{3,3}\)-minor free graphs
- Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs
- Extremizing first eigenvalue of 3-colored digraphs made with given blocks
- On the third largest eigenvalue of graphs
- scientific article; zbMATH DE number 6116782 (Why is no real title available?)
- Edge connectivity, packing spanning trees, and eigenvalues of graphs
- The vertex connectivity and the third largest eigenvalue in regular (multi-)graphs
- Graphs with three eigenvalues and second largest eigenvalue at most 1
This page was built for publication: On the third largest eigenvalue of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587896)
