A note on spectral radius and degree deviation in graphs
type: Item
instance of: scholarly article
title: A note on spectral radius and degree deviation in graphs
zbMATH Open document ID: 1472.05106
author: Wenqian Zhang
published in: Discrete Mathematics
publication date: 2021-06-14T00:00:00Z
review text: The study of spectral radius of irregular graphs is an interesting topic. Let \(G\) be a graph on \(n\) vertices with \(m\) edges, and \(d_1, d_2, \ldots, d_n\) be the degrees of the vertices in \(G\). Set \[ s(G) = \sum_{1\leq i\leq n}\left|d_i - \frac{2m}{n}\right|, \] which is called the degree deviation. Let \(\lambda_1(G)\) denote the largest eigenvalue of the adjacency matrix of \(G\). \textit{V. Nikiforov} [Linear Algebra Appl. 414, No. 1, 347--360 (2006; Zbl 1092.05046)] proved that \[ \frac{s^2(G)}{2n^2\sqrt{2m}}\leq \lambda_1(G)- \frac{2m}{n} \le \sqrt{s(G)}, \] and conjectured that \[ \lambda_1(G)- \frac{2m}{n} \le \sqrt{\frac{1}{2}s(G)}, \] if \(n\) and \(m\) are large enough. In this paper, the author prove that \[ \lambda_1(G)- \frac{2m}{n} \le \sqrt{\frac{9}{10}s(G)}, \] which improves the result in [loc. cit.]. Moreover, the author confirm that the above conjecture is valid if \(G\) is bipartite.
reviewed by: Xiaogang Liu
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C07
zbMATH DE Number: 7358427
zbMATH Keywords: spectral radius
zbMATH Keywords: adjacency matrix
zbMATH Keywords: irregular graph
zbMATH Keywords: degree deviation
MaRDI profile type: Publication
full work available at URL: j.disc.2021.112429
OpenAlex ID: W3159823729
cites work: On the maximal index of connected graphs
cites work: Spectra of graphs
cites work: On the first eigenvalue of bipartite graphs
cites work: A lower bound for the spectral radius of graphs with fixed diameter
cites work: Large matchings from eigenvalues
cites work: Q3642517
cites work: A bound on the spectral radius of graphs
cites work: A sharp upper bound of the spectral radius of graphs
cites work: On the spectral radius of graphs with connectivity at most \(k\)
cites work: On the spectral radius of graphs with cut edges
cites work: Spectral radius and degree sequence of a graph
cites work: Eigenvalues and degree deviation in graphs
cites work: Bounds on graph eigenvalues. II
cites work: On the maximal index of graphs with a prescribed number of edges
cites work: Sharp upper bounds on the spectral radius of graphs
cites work: The spectral radius of trees on \(k\) pendant vertices
DOI: 10.1016/J.DISC.2021.112429
description: scientific article; zbMATH DE number 7358427