Properties of Full-Flag Johnson Graphs
Combinatorics
2013-09-17 v2
Abstract
We introduce and study a variant of the family of Johnson graphs, the Full-Flag Johnson graphs. We show that Full-Flag Johnson graphs are Cayley graphs on S_n generated by certain classes of permutations, and that they are in fact generalizations of permutahedra. We derive some results about the adjacency matrices of Full-Flag Johnson graphs and apply these to the set of permutahedra to deduce part of their spectra.
Keywords
Cite
@article{arxiv.1301.1131,
title = {Properties of Full-Flag Johnson Graphs},
author = {Irving Dai and Michael Greenberg and Noah Schoem and Matt Tanzer},
journal= {arXiv preprint arXiv:1301.1131},
year = {2013}
}