On the two largest distance eigenvalues of graph powers

详细信息    查看全文

• 作者：Rundan Xing^a ; ^{rundanxing@126.com} ; Bo Zhou^b ; ^{zhoubo@scnu.edu.cn}
• 关键词：Combinatorial problems ; Distance eigenvalues ; k-th Power of a graph ; Tree ; Unicyclic graph
• 刊名：Information Processing Letters
• 出版年：2017
• 出版时间：March 2017
• 年：2017
• 卷：119
• 期：Complete
• 页码：39-43
• 全文大小：276 K
• 卷排序：119

文摘

Lower bounds for first two largest distance eigenvalues of graph powers are given. All trees and unicyclic graphs G   with λ2(G2)<5−32 are determined. Unique n-vertex trees G   with small λ1(G2)λ1(G2) and λ2(G2)λ2(G2) are determined.