文献类型：期刊文献

英文题名：The inertia and energy of the distance matrix of a connected graph

作者：Lin, Huiqiu[1];Liu, Ruifang[2];Lu, Xiwen[1]

机构：[1]E China Univ Sci & Technol, Dept Math, Shanghai 200237, Peoples R China;[2]Zhengzhou Univ, Sch Math & Stat, Zhengzhou 450001, Henan, Peoples R China

年份：2015

卷号：467

起止页码：29

外文期刊名：LINEAR ALGEBRA AND ITS APPLICATIONS

收录：;EI(收录号：20150300429805);WOS:【SCI-EXPANDED(收录号:WOS:000348260300003)】；

基金：Supported by the National Natural Science Foundation of China (Nos. 11371137, 11401211 and 11201432).

语种：英文

外文关键词：D-eigenvalue; The distance spectral radius; Inertia; Distance energy

摘要：Let G be a connected graph and D(G) be the distance matrix of G. Suppose that lambda(1)(D) >= lambda(2)(D) >= ... >= lambda(n)(D) are the D-eigenvalues of G. In this paper, we show that the distance matrix of a clique tree is non-singular. Moreover, we also prove that the distance matrix of a clique tree has exactly one positive D-eigenvalue. In addition, we determine the extremal graphs with maximum and minimum distance energy among all clique trees. (C) 2014 Elsevier Inc. All rights reserved.