The distance spectra of the derangement graphs
Combinatorics
2016-10-24 v1
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.
Cite
@article{arxiv.1610.06735,
title = {The distance spectra of the derangement graphs},
author = {Yunnan Li and Huiqiu Lin},
journal= {arXiv preprint arXiv:1610.06735},
year = {2016}
}