Eigenvalues and degree deviation in graphs
The author shows that the difference \(\mu(G)-\frac{2m}{n}\) of the spectral radius of the adjacency matrix and the average degree in a graph is bounded both from below and from above by the function of the degree deviation \(s(G)=\sum_{u\in V(G)} | d(u)-\frac{2m}{n}| \), where \(d(u)\) is the degree of vertex \(u\). The author gives some further inequalities involving the eigenvalues and the degree deviation and shows that they are all tight to a constant factor. The paper also contains a useful section on efficient regularization, giving a good approximate answer to the question: ``What is the minimum number of edges that must be changed to obtain a regular graph?
- A bound on the spectral radius of graphs with \(e\) edges
- A note on the irregularity of graphs
- Graphs and Hermitian matrices: eigenvalue interlacing
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- Interlacing eigenvalues and graphs
- Matrix Analysis
- On the spectral radius of graphs with cut vertices
- Spectral Radius and Degree Sequence
- Spektren endlicher Grafen
- Eigenvalues, diameter, and mean distance in graphs
- Eigenvalues and separation in graphs
- On the irregularity of uniform hypergraphs
- Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees
- A note on spectral radius and degree deviation in graphs
- On the upper bounds for the degree deviation of graphs
- Degree subtraction eigenvalues and energy of graphs
- Three conjectures in extremal spectral graph theory
- More eigenvalue problems of Nordhaus-Gaddum type
- Bounds on graph eigenvalues. II
- Some lower bounds for the energy of graphs in terms of spread of matrix
- Remarks on the energy of regular graphs
- Characterizing graphs of maximum principal ratio
- scientific article; zbMATH DE number 7020672 (Why is no real title available?)
- On the variance-type graph irregularity measures
- Centralities of a network and its line graph: an analytical comparison by means of their irregularity
- On a Conjecture about Degree Deviation Measure of Graphs
- Irregularity of graphs
- On the transmission-based graph topological indices
- High Degree Vertices and Eigenvalues in the Preferential Attachment Graph
- On relations between Kirchhoff index, Laplacian energy, Laplacian-energy-like invariant and degree deviation of graphs
- Aα-spectral radius and measures of graph irregularity
- On the irregularity of graphs based on the arithmetic-geometric mean inequality
- On the irregularity of uniform hypergraphs
- Bounding the A_-spectral radius of k-connected irregular graphs
- Analytical relationships between metric and centrality measures of a network and its dual
- Line graphs and Nordhaus-Gaddum-type bounds for self-loop graphs
- On spectral irregularity of graphs
- Degree scaling irregularities
- Some basic mathematical properties of the misbalance Hadeg index of graphs
- Degree deviation and spectral radius
- The least balanced graphs and trees
- Graph irregularity characterization with particular regard to bidegreed graphs
- An optimization approach to degree deviation and spectral radius
- On k-stepwise irregular graphs
- Bounds on topological indices of trees on special graph classes
- Laplacian spectral metrics of some graph operations
- Eigenvalues and extremal degrees of graphs
- Eigenvalue problems of Nordhaus--Gaddum type
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)
