On the distance spectral gap and construction of D-equienergetic graphs

2025/02/11 by T, Haritha, A., Chithra
#05C12 #05C50 #05C76 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2502.07398

Abstract

Let D(G) denote the distance matrix of a connected graph G with n vertices. The distance spectral gap of a graph G is defined as δ_D^G = ρ₁ - ρ₂, where ρ₁ and ρ₂ represent the largest and second largest eigenvalues of D(G), respectively. For a k-transmission regular graph G, the second smallest eigenvalue of the distance Laplacian matrix equals the distance spectral gap of G. In this article, we obtain some upper and lower bounds for the distance spectral gap of a graph in terms of the sum of squares of its distance eigenvalues. Additionally, we provide some bounds for the distance eigenvalues and distance energy of graphs. Furthermore, we construct new families of non D-cospectral D-equienergetic graphs with diameters of 3 and 4.

Related

• On the second largest distance eigenvalue of a graph
• More results on the distance (signless) Laplacian eigenvalues of graphs
• Distance matrix correlation spectrum of graphs
• The distance spectrum of the complements of graphs of diameter greater than three
• Bounds For The Distance Estrada Index Of Graphs