Bounds on the $\alpha$-distance spectrum of graphs
Combinatorics
2019-08-13 v1
Abstract
For a simple, undirected and connected graph , is called the -distance matrix of , where , is the distance matrix of , and is the vertex transmission diagonal matrix of . Recently, the -distance energy of was defined based on the spectra of . In this paper, we define the -distance Estrada index of in terms of the eigenvalues of . And we give some bounds on the spectral radius of , -distance energy and -distance Estrada index of .
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}
}