Eigenvalues and forbidden subgraphs I
classification
🧮 math.CO
math.AC
keywords
eigenvalueadjacencyedgeseigenvaluesforbiddengraphinequalitieslaplacian
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.