pith. sign in

arxiv: 1408.5615 · v1 · pith:HIXVL244new · submitted 2014-08-24 · 🧮 math.CO

Notes on simplicial rook graphs

classification 🧮 math.CO
keywords graphrooksequencessimplicialadjacentautomorphismchoosecommon
0
0 comments X
read the original abstract

The simplicial rook graph ${\rm 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 ${\rm SR}(m,n)$ has integral eigenvalues, and smallest eigenvalue $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+n-1,n)$. We determine the automorphism group and several other properties.

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.