Notes on simplicial rook graphs

Journal of Algebraic Combinatorics: An International Journal(2015)

Cited 2|Views12
No score
Abstract
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, -m ()2) , 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.
More
Translated text
Key words
Simplicial rook graph,Graph spectra,Integral graph,Johnson graph,Equitable partition
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined