Notes on simplicial rook graphs

DOI10.1007/S10801-015-0633-YMaRDI QIDQ295823zbMATH OpenOpenAlexWikidataFDO

Authors Sebastian Cioaba, Willem H. Haemers, Jason R. Vermette, Andries E. Brouwer

Publication date 13 June 2016

Published in Journal of Algebraic Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1408.5615

zbMATH Keywords

equitable partitionJohnson graphgraph spectraintegral graphsimplicial rook graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Abstract: The simplicial rook graph $mSR(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 $mSR(m,n)$ has integral eigenvalues, and smallest eigenvalue $s=max(-n,-mchoose2)$, 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.

Recommendations

• On the spectra of simplicial rook graphs
• On the maximum number of non-attacking rooks on a high-dimensional simplicial chessboard
• scientific article; zbMATH DE number 4093496

Cites work

• scientific article; zbMATH DE number 3145665 (Why is no real title available?)
• scientific article; zbMATH DE number 3152621 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 47598 (Why is no real title available?)
• scientific article; zbMATH DE number 1789345 (Why is no real title available?)
• Constructing cospectral graphs
• Nonattacking Queens on a Triangle
• Putting dots in triangles
• Spectra of graphs

Cited in

(5)

• scientific article; zbMATH DE number 227303 (Why is no real title available?)
• On the maximum number of non-attacking rooks on a high-dimensional simplicial chessboard
• Rook-Drawing for Plane Graphs
• On the spectra of simplicial rook graphs
• Diameter bounds and recursive properties of Full-Flag Johnson graphs

Describes a project that uses

Uses Software

• MathOverflow

This page was built for publication: Notes on simplicial rook graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q295823)