Notes on simplicial rook graphs
Combinatorics
2014-08-26 v1
Abstract
The simplicial rook graph is the graph of which the vertices are the sequences of nonnegative integers of length summing to , where two such sequences are adjacent when they differ in precisely two places. We show that has integral eigenvalues, and smallest eigenvalue , and that this graph has a large part of its spectrum in common with the Johnson graph . We determine the automorphism group and several other properties.
Cite
@article{arxiv.1408.5615,
title = {Notes on simplicial rook graphs},
author = {Andries E. Brouwer and Sebastian M. Cioabă and Willem H. Haemers and Jason R. Vermette},
journal= {arXiv preprint arXiv:1408.5615},
year = {2014}
}