arXiv:1610.06735 Abstract | arXiv Analytics

arXiv:1610.06735 [math.CO]Abstract References Reviews Resources

The distance spectra of the derangement graphs

Published 2016-10-21Version 1

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.

Categories: math.CO

Subjects: 05A05, 05C50

Keywords: distance spectra, extremal distance eigenvalues, connected derangement graphs, constructive proof

Related articles: Most relevant | Search more

arXiv:1104.1097 [math.CO] (Published 2011-04-06)

Distance spectra and Distance energy of Integral Circulant Graphs

Aleksandar Ili\' c

arXiv:1512.04160 [math.CO] (Published 2015-12-14)

Hypercubes are determined by their distance spectra

Jack. H. Koolen, Sakander Hayat, Quaid Iqbal

arXiv:math/0310444 [math.CO] (Published 2003-10-28)

A Constructive Proof of Ky Fan's Generalization of Tucker's Lemma