文献类型：期刊文献

英文题名：On the distance spectrum of graphs

作者：Lin, Huiqiu[1];Hong, Yuan[2];Wang, Jianfeng[3];Shu, Jinlong[2]

机构：[1]E China Univ Sci & Technol, Sch Sci, Dept Math, Shanghai 200237, Peoples R China;[2]E China Normal Univ, Dept Math, Shanghai 200062, Peoples R China;[3]Qinghai Normal Univ, Dept Math, Xining 810008, Qinghai, Peoples R China

年份：2013

卷号：439

期号：6

起止页码：1662

外文期刊名：LINEAR ALGEBRA AND ITS APPLICATIONS

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

基金：Supported by NSFC (Nos. 11075057, 11071078 and 11271315).

语种：英文

外文关键词：D-eigenvalue; The distance spectral radius; The least D-eigenvalue; Complete kappa-partite graph

摘要：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 characterize all connected graphs with lambda(n) (D) = -2. Furthermore, we characterize all connected graphs of diameter 2 with exactly three D-eigenvalues when lambda(1) (D) is not an integer. We also conjecture that the complete kappa-partite graph is determined by its D-spectrum. (C) 2013 Elsevier Inc. All rights reserved.