6
$\begingroup$

Does there exist a finite nonoriented graph whose automorphism group is transitive but not generously transitive (that is, it is not true that each pair $(x,y)$ of vertices can be interchanged by some automorphism)?

I know, for example, that Cayley graphs are always generously vertex-transitive.

$\endgroup$
6
$\begingroup$

Cayley graphs for abelian groups have generously transitive automorphism groups. In general a Cayley graph for a non-abelian group will not be generously transitive.

In particular if $G$ is not abelian and $X$ is a so-called graphical regular representation (abbreviated GRR) for $G$, then its automorphism group is not generously transitive. The key property of a GRR is that the stabilizer of a vertex is trivial.

Constructing GRRs is not trivial, but it is expected that most Cayley graphs for groups that are not abelian or generalized dicylic will be GRRs - so choosing a connection set at random usually works.

$\endgroup$
  • $\begingroup$ So this answer has some connection to this question, I think? $\endgroup$ – vidyarthi May 6 at 8:39
0
$\begingroup$

This one, unless I'm mistaken... https://en.wikipedia.org/wiki/Icosidodecahedron

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.