Capturing polytopal symmetries by coloring the edge-graph
From MaRDI portal
Publication:6204769
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Coloring of graphs and hypergraphs (05C15) Polyhedra and polytopes; regular figures, division of spaces (51M20) Symmetry properties of polytopes (52B15)
Abstract: A general (convex) polytope and its edge-graph can have very distinct symmetry properties. We construct a coloring (of the vertices and edges) of the edge-graph so that the combinatorial symmetry group of the colored edge-graph is isomorphic (in a natural way) to , the group of linear symmetries of the polytope. We also construct an analogous coloring for , the group of orthogonal symmetries of .
Recommendations
Cites work
- scientific article; zbMATH DE number 1303522 (Why is no real title available?)
- Affine symmetries of orbit polytopes
- Computing symmetry groups of polyhedra
- Drawing graphs by eigenvectors: theory and practice
- Neighborly cubical polytopes
- On combinatorial and affine automorphisms of polytopes
- Polyhedral representation conversion up to symmetries
- Symmetries of 3-polytopes with fixed edge length
- The Colin de Verdière number and graphs of polytopes
- The edge-transitive polytopes that are not vertex-transitive
This page was built for publication: Capturing polytopal symmetries by coloring the edge-graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6204769)