English

Notes on simplicial rook graphs

Combinatorics 2014-08-26 v1

Abstract

The simplicial rook graph SR(m,n){\rm SR}(m,n) is the graph of which the vertices are the sequences of nonnegative integers of length mm summing to nn, where two such sequences are adjacent when they differ in precisely two places. We show that SR(m,n){\rm SR}(m,n) has integral eigenvalues, and smallest eigenvalue s=max(n,(m2))s = \max (-n, -{m \choose 2}), and that this graph has a large part of its spectrum in common with the Johnson graph J(m+n1,n)J(m+n-1,n). 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}
}
R2 v1 2026-06-22T05:38:03.502Z