The simplicial rook graph SR (m, n) is the graph of which the vertices are the sequences of nonnegative integers of length m summing to n, where two such sequences are adjacent when they differ in precisely two places. We show that SR (m, n) has integral eigenvalues, and smallest eigenvalue s=max (- n, - (m2)) , and that this graph has a large part of its spectrum in common with the Johnson graph J(m+ n- 1, n). We determine the automorphism group and several other properties.
CITATION STYLE
Brouwer, A. E., Cioabă, S. M., Haemers, W. H., & Vermette, J. R. (2016). Notes on simplicial rook graphs. Journal of Algebraic Combinatorics, 43(4), 783–799. https://doi.org/10.1007/s10801-015-0633-y
Mendeley helps you to discover research relevant for your work.