The graphicahedron
Por:
Araujo-Pardo G., Del Río-Francos M., López-Dudet M., Oliveros D., Schulte E.
Publicada:
1 oct 2010
Resumen:
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 g(G) of the symmetric group S(p) and then construct a vertex-transitive simple polytope of rank q, the graphicahedron, whose 1-skeleton (edge graph) is g(G). 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. (C) 2010 Elsevier Ltd. All rights reserved.
Filiaciones:
Araujo-Pardo G.:
Univ Nacl Autonoma Mexico, Inst Matemat, Mexico City 04510, DF, Mexico
Del Río-Francos M.:
Univ Nacl Autonoma Mexico, Inst Matemat, Mexico City 04510, DF, Mexico
López-Dudet M.:
Univ Nacl Autonoma Mexico, Inst Matemat, Mexico City 04510, DF, Mexico
Oliveros D.:
Univ Nacl Autonoma Mexico, Inst Matemat, Mexico City 04510, DF, Mexico
Schulte E.:
Department of Mathematics, Northeastern University, Boston, United States
All Open Access; Bronze
|