The graphicahedron

DOI10.1016/J.EJC.2010.03.004MaRDI QIDQ709258zbMATH OpenOpenAlexFDO

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

Publication date 18 October 2010

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

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

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

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.

Recommendations

• Symmetric graphicahedra
• Graphic vertices of the metric polytope
• scientific article; zbMATH DE number 4192524
• The correlahedron
• scientific article; zbMATH DE number 739039
• Polygonal graphs
• Graphs of polyhedra; polyhedra as graphs

Cites work

• scientific article; zbMATH DE number 4016785 (Why is no real title available?)
• scientific article; zbMATH DE number 3652359 (Why is no real title available?)
• scientific article; zbMATH DE number 3656179 (Why is no real title available?)
• scientific article; zbMATH DE number 47598 (Why is no real title available?)
• scientific article; zbMATH DE number 1055145 (Why is no real title available?)
• scientific article; zbMATH DE number 3407710 (Why is no real title available?)
• A simple way to tell a simple polytope from its graph
• Abstract Regular Polytopes
• CPR graphs and regular polytopes
• Cayley graphs and symmetric 4-polytopes
• Combinatorial Properties of Associated Zonotopes
• Eisenstein integers and related \(C\)-groups
• Hermitian forms and locally toroidal regular polytopes
• Oriented Matroids
• Puzzles and polytope isomorphisms
• Regular incidence-polytopes with Euclidean or toroidal faces and vertex- figures
• Root systems and generalized associahedra
• Space tiling zonotopes
• Symmetric graphicahedra

Cited in

(12)

• Mirror graphs: graph theoretical characterization of reflection arrangements and finite Coxeter groups
• Cayley graphs for some well-known groups
• Generalized CPR-graphs and applications
• Toric Bruhat interval polytopes
• The correlahedron
• CPR graphs and regular polytopes
• The monodromy group of a truncated simplex
• Capturing polytopal symmetries by coloring the edge-graph
• On the flag graphs of regular abstract polytopes: Hamiltonicity and Cayley index
• Symmetric graphicahedra
• Colorful polytopes and graphs
• Cayley graphs and symmetric 4-polytopes

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)