Linear and Multilinear Algebra ( IF 1.1 ) Pub Date : 2021-04-05 , DOI: 10.1080/03081087.2021.1910617 Yuqing Ji 1 , Jianfeng Wang 1 , Maurizio Brunetti 2 , Ning Bian 1
ABSTRACT
Let G be a graph with order n and size m. For each real number , the -matrix of a graph G is defined as , where is the degree matrix of G, and is its adjacency matrix. The functions have been already used elsewhere as measures of graph irregularity. In this paper, we find several bounds for the spectral radius of the matrix . Especially, when G is non-empty we prove for that where and is the maximum vertex degree of G. These inequalities extend to the -matrix a Nikiforov's result involving the spectral radius of the adjacency matrix. In addition, for fixed order and size, we determine the graphs minimizing the degree variance and compute the -spectrum of some blown-up graphs.
中文翻译:
Aα-谱半径和图形不规则性的度量
摘要
令G为阶数为n且大小为m的图。对于每个实数, 这- 图G的矩阵定义为, 在哪里是G的度矩阵,并且是它的邻接矩阵。功能已经在其他地方用作图形不规则性的度量。在本文中,我们找到了光谱半径的几个界限矩阵的. 特别是,当G非空时,我们证明那在哪里和是G的最大顶点度。这些不平等延伸到-matrix 涉及邻接矩阵谱半径的 Nikiforov 结果。此外,对于固定顺序和大小,我们确定最小化度方差的图并计算-一些放大图的频谱。