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).
Recommendations
Cites work
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- A bound on the spectral radius of graphs with \(e\) edges
- A note on the irregularity of graphs
- Graphs and Hermitian matrices: eigenvalue interlacing
- Interlacing eigenvalues and graphs
- Matrix Analysis
- On the spectral radius of graphs with cut vertices
- Spectral Radius and Degree Sequence
- Spektren endlicher Grafen
Cited in
(30)- Degree subtraction eigenvalues and energy of graphs
- Eigenvalues and extremal degrees of graphs
- Line graphs and Nordhaus-Gaddum-type bounds for self-loop graphs
- High Degree Vertices and Eigenvalues in the Preferential Attachment Graph
- On a Conjecture about Degree Deviation Measure of Graphs
- More eigenvalue problems of Nordhaus-Gaddum type
- Eigenvalue problems of Nordhaus--Gaddum type
- On relations between Kirchhoff index, Laplacian energy, Laplacian-energy-like invariant and degree deviation of graphs
- On the irregularity of uniform hypergraphs
- Centralities of a network and its line graph: an analytical comparison by means of their irregularity
- On the irregularity of uniform hypergraphs
- Remarks on the energy of regular graphs
- A note on spectral radius and degree deviation in graphs
- Eigenvalues and separation in graphs
- Three conjectures in extremal spectral graph theory
- On spectral irregularity of graphs
- On the variance-type graph irregularity measures
- Characterizing graphs of maximum principal ratio
- Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees
- Irregularity of graphs
- Analytical relationships between metric and centrality measures of a network and its dual
- Eigenvalues, diameter, and mean distance in graphs
- On the upper bounds for the degree deviation of graphs
- Bounding the \(A_\alpha\)-spectral radius of \(k\)-connected irregular graphs
- On the transmission-based graph topological indices
- Some lower bounds for the energy of graphs in terms of spread of matrix
- Bounds on graph eigenvalues. II
- On the irregularity of graphs based on the arithmetic-geometric mean inequality
- scientific article; zbMATH DE number 7020672 (Why is no real title available?)
- Aα-spectral radius and measures of graph irregularity
This page was built for publication: Eigenvalues and degree deviation in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q819785)