TY - JOUR

T1 - Bounds for the Generalized Distance Eigenvalues of a Graph

AU - Alhevaz, Abdollah

AU - Baghipur, Maryam

AU - Ganie, Hilal Ahmad

AU - Shang, Yilun

PY - 2019/12/17

Y1 - 2019/12/17

N2 - Let G be a simple undirected graph containing n vertices. Assume G is connected. Let D ( G ) be the distance matrix, D L ( G ) be the distance Laplacian, D Q ( G ) be the distance signless Laplacian, and T r ( G ) be the diagonal matrix of the vertex transmissions, respectively. Furthermore, we denote by D α ( G ) the generalized distance matrix, i.e., D α ( G ) = α T r ( G ) + ( 1 - α ) D ( G ) , where α ∈ [ 0 , 1 ] . In this paper, we establish some new sharp bounds for the generalized distance spectral radius of G, making use of some graph parameters like the order n, the diameter, the minimum degree, the second minimum degree, the transmission degree, the second transmission degree and the parameter α , improving some bounds recently given in the literature. We also characterize the extremal graphs attaining these bounds. As an special cases of our results, we will be able to cover some of the bounds recently given in the literature for the case of distance matrix and distance signless Laplacian matrix. We also obtain new bounds for the k-th generalized distance eigenvalue.

AB - Let G be a simple undirected graph containing n vertices. Assume G is connected. Let D ( G ) be the distance matrix, D L ( G ) be the distance Laplacian, D Q ( G ) be the distance signless Laplacian, and T r ( G ) be the diagonal matrix of the vertex transmissions, respectively. Furthermore, we denote by D α ( G ) the generalized distance matrix, i.e., D α ( G ) = α T r ( G ) + ( 1 - α ) D ( G ) , where α ∈ [ 0 , 1 ] . In this paper, we establish some new sharp bounds for the generalized distance spectral radius of G, making use of some graph parameters like the order n, the diameter, the minimum degree, the second minimum degree, the transmission degree, the second transmission degree and the parameter α , improving some bounds recently given in the literature. We also characterize the extremal graphs attaining these bounds. As an special cases of our results, we will be able to cover some of the bounds recently given in the literature for the case of distance matrix and distance signless Laplacian matrix. We also obtain new bounds for the k-th generalized distance eigenvalue.

KW - distance matrix (spectrum)

KW - distance signlees Laplacian matrix (spectrum)

KW - (generalized) distance matrix

KW - spectral radius

KW - transmission regular graph

U2 - 10.3390/sym11121529

DO - 10.3390/sym11121529

M3 - Article

VL - 11

JO - Symmetry

JF - Symmetry

SN - 2073-8994

IS - 12

M1 - 1529

ER -