The Distance Energy of Clique Trees
Combinatorics
2021-02-23 v1
Abstract
The distance energy of a simple connected graph is defined as the sum of absolute values of its distance eigenvalues. In this paper, we mainly give a positive answer to a conjecture of distance energy of clique trees proposed by Lin, Liu and Lu [H.~Q.~ Lin, R.~F.~Liu, X.~W.~Lu, The inertia and energy of the distance matrix of a connected graph, {\it Linear Algebra Appl.,} 467 (2015), 29-39.]
Cite
@article{arxiv.2102.10241,
title = {The Distance Energy of Clique Trees},
author = {Ya-Lei Jin and Rui Gu and Xiao-Dong Zhang},
journal= {arXiv preprint arXiv:2102.10241},
year = {2021}
}
Comments
10 pages, 1 figure