Eigenvalues and extremal degrees in graphs
classification
🧮 math.CO
keywords
degreeseigenvaluesgraphsadjacencyappliedconditionsderiveextremal
read the original abstract
We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.
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.