The graphicahedron

From MaRDI portal
Publication:709258

DOI10.1016/J.EJC.2010.03.004zbMATH Open1222.05093arXiv0910.3908OpenAlexW2913036287MaRDI QIDQ709258FDOQ709258

Mariana López-Dudet, Egon Schulte, María Del Río Francos, G. Araujo-Pardo, Deborah Oliveros

Publication date: 18 October 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: The paper describes a construction of abstract polytopes from Cayley graphs of symmetric groups. Given any connected graph G with p vertices and q edges, we associate with G a Cayley graph of the symmetric group S_p and then construct a vertex-transitive simple polytope of rank q, called the graphicahedron, whose 1-skeleton (edge graph) is the Cayley graph. The graphicahedron of a graph G is a generalization of the well-known permutahedron; the latter is obtained when the graph is a path. We also discuss symmetry properties of the graphicahedron and determine its structure when G is small.


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





Cites Work


Cited In (5)


Recommendations





This page was built for publication: The graphicahedron

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