The distance spectra of the derangement graphs
classification
🧮 math.CO
keywords
distancederangementgraphsspectraconnectedconsiderconstructivedetermine
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.