Properties of Full-Flag Johnson Graphs
classification
🧮 math.CO
keywords
graphsjohnsonfull-flagpermutahedraadjacencyapplycayleycertain
read the original 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.
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.