Graphs with at most three distance eigenvalues different from -1 and -2

2017/08/26 by Huang, Xueyi, Huang, Qiongxiang, Lu, Lu
#05C50 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1708.07979

Abstract

Let G be a connected graph on n vertices, and let D(G) be the distance matrix of G. Let ∂₁(G)≥∂₂(G)≥⋯≥∂_n(G) denote the eigenvalues of D(G). In this paper, we characterize all connected graphs with ∂₃(G)≤ -1 and ∂_n-1(G)≥ -2. By the way, we determine all connected graphs with at most three distance eigenvalues different from -1 and -2.

Related

• Graphs with three distinct distance eigenvalues
• The least distance eigenvalue of the complements of graphs of diameter greater than three
• On graphs with m(∂^L₁)=n-3
• Tricyclic graphs for which the second largest distance eigenvalue less than -(1)/(2)
• On the second largest distance eigenvalue of a graph