Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Associated with a graph $G$ and its automorphism group $\text{Aut}(G)$ (reflecting its combinatorial symmetries) are drawings in the plane with - eventually - one or more (geometric) symmetry groups.

For example the Petersen graph with automorphism group $S_5$ can be drawn with symmetry groups $D_1$, $D_5$ (dihedral groups), or cyclic group $\mathbb{Z}/5\mathbb{Z}$.

What can be said about possible combinations of geometric symmetry groups of graph drawings and their dependence on the automorphism group of the graph?

Is there for example always exactly one largest geometric symmetry group?

(Note that there are graphs with non-trivial automorphism group which don't admit a symmetric drawing in the plane at all:

enter image description here

So on what else than the automorphism group does it depend whether there are geometric symmetries? Are there graphs with arbitrarily large automorphism group but without a symmetric drawing?)

share|cite|improve this question
What do you assume about the "geometric symmetries" except that they move vertices and edges as expected? Are they to be plane isometries? Homeomorphisms? – tomasz Jun 1 '13 at 22:57
I mean rotations and reflections. (What risk of confusion is there?) – Hans Stricker Jun 1 '13 at 23:01
None anymore, I think. – tomasz Jun 1 '13 at 23:17
I should have asked: What risk of confusion was there? – Hans Stricker Jun 1 '13 at 23:21
I am aware of Frucht's Theorem, but to be honest, I cannot see immediately how it answers my question. – Hans Stricker Jun 1 '13 at 23:33

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.