Abstract: We present sharp inequalities relating the number of vertices, edges, and triangles of a graph to the smallest eigenvalue of its adjacency matrix and the largest eigenvalue of its Laplacian.
Recommendations
Cites work
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- Graphs and Hermitian matrices: eigenvalue interlacing
- On maximal paths and circuits of graphs
- On the extreme eigenvalues of regular graphs.
- The smallest eigenvalue of \(K_{r}\)-free graphs
Cited in
(8)- Note on the sum of the smallest and largest eigenvalues of a triangle-free graph
- The smallest eigenvalue of \(K_{r}\)-free graphs
- Bounds on graph eigenvalues. II
- A Forbidden Set for Embedded Eigenvalues
- Eigenvalues and triangles in graphs
- New analytical lower bounds on the clique number of a graph
- New results for MaxCut in H$H$‐free graphs
- The relation between eigenvalue and Laplacian degree of complete tripartite hypergraphs
This page was built for publication: Eigenvalues and forbidden subgraphs. I.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869937)
