文献类型：期刊文献

英文题名：The distance spectrum of complements of trees

作者：Lin, Huiqiu[1];Drury, Stephen[2]

机构：[1]East China Univ Sci & Technol, Sch Sci, Dept Math, Shanghai 200237, Peoples R China;[2]McGill Univ, Dept Math & Stat, Montreal, PQ H3A 0B9, Canada

年份：2017

卷号：530

起止页码：185

外文期刊名：LINEAR ALGEBRA AND ITS APPLICATIONS

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

基金：The first author is supported by the National Natural Science Foundation of China (Nos. 11401211 and 11471121) and Fundamental Research Funds for the Central Universities (No. 222201714049).

语种：英文

外文关键词：Distance spectrum; Complement of trees; Least distance eigenvalue

摘要：Let G be a connected graph of order n and D(G) be its distance matrix. In this paper, we characterize the unique graphs whose distance spectral radius attains the maximum and minimum among all complements of trees. Furthermore, we determine the unique graphs whose least distance eigenvalues attains the maximum and minimum among all complements of trees. (C) 2017 Elsevier Inc. All rights reserved.