Journal of Lanzhou University of Technology ›› 2022, Vol. 48 ›› Issue (5): 148-152.

• Scientific • Previous Articles     Next Articles

The generalized distance eigenvalues of graphs

LU Peng-li, ZHONG Yu   

  1. School of Computer and Communication, Lanzhou Univ. of Tech., Lanzhou 730050, China
  • Received:2021-12-21 Online:2022-10-28 Published:2022-11-21

Abstract: The generalized distance matrix of a connected graph G is defined asDα(G)=αTr(G)+(1-α)D(G), 0≤α≤1, where D(G) and Tr(G) represent the distance matrix and diagonal matrix of the transmissions of G, respectively. In this paper, the generalized distance correlation spectrum is studied, with the bounds of the spectrum radius, the second largest eigenvalue, and the generalized distance spectrum of the self-complementary graph given.

Key words: generalized distance matrix, generalized distance spectral radius, self-complementary graph

CLC Number: