English

Bounds on the $\alpha$-distance spectrum of graphs

Combinatorics 2019-08-13 v1

Abstract

For a simple, undirected and connected graph GG, Dα(G)=αTr(G)+(1α)D(G)D_{\alpha}(G) = \alpha Tr(G) + (1-\alpha) D(G) is called the α\alpha-distance matrix of GG, where α[0,1]\alpha\in [0,1], D(G)D(G) is the distance matrix of GG, and Tr(G)Tr(G) is the vertex transmission diagonal matrix of GG. Recently, the α\alpha-distance energy of GG was defined based on the spectra of Dα(G)D_{\alpha}(G). In this paper, we define the α\alpha-distance Estrada index of GG in terms of the eigenvalues of Dα(G)D_{\alpha}(G). And we give some bounds on the spectral radius of Dα(G)D_{\alpha}(G), α\alpha-distance energy and α\alpha-distance Estrada index of GG.

Keywords

Cite

@article{arxiv.1908.03893,
  title  = {Bounds on the $\alpha$-distance spectrum of graphs},
  author = {Yang Yang and Lizhu Sun and Changjiang Bu},
  journal= {arXiv preprint arXiv:1908.03893},
  year   = {2019}
}