Eigenvalues and degree deviation in graphs
classification
🧮 math.CO
keywords
eigenvaluesboundsdegreedeviationgivengraphgraphsinvestigate
read the original abstract
Given a graph G of order n and size m, let s(G)= sum|d(u)-2m/n|, where the sum is taken over all vertices u of G. We investigate upper and lower bounds on eigenvalues of G in terms of s(G).
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.