The distance spectra of the derangement graphs

2016/10/21 by Yunnan Li, Huiqiu Lin, Li, Yunnan +1
Mathematics · Computer Science · #Graph theory and applications #Graph Labeling and Dimension Problems #Spectral Theory in Mathematical Physics

paper · pdf · doi:10.48550/arxiv.1610.06735

Abstract

In this paper, we consider the distance spectra of the derangement graphs. First we give a constructive proof that the connected derangement graphs are of diameter 2. Then we obtain their distance spectra. In particular, we determine all their extremal distance eigenvalues.

Related

• On the distance spectra of graphs
• Distance spectra of some double join of graphs and some new families of distance equienergetic graphs
• On the second largest distance eigenvalue of a graph
• The distance spectrum of the complements of graphs of diameter greater than three
• Graphs with small diameter determined by their D-spectra