A 27-vertex graph that is vertex-transitive and edge-transitive but not l-transitive
Combinatorics
2007-05-23 v1
Abstract
I describe a 27-vertex graph that is vertex-transitive and edge-transitive but not 1-transitive. Thus while all vertices and edges of this graph are similar, there are no edge-reversing automorphisms.
Keywords
Cite
@article{arxiv.math/0703861,
title = {A 27-vertex graph that is vertex-transitive and edge-transitive but not l-transitive},
author = {Peter G. Doyle},
journal= {arXiv preprint arXiv:math/0703861},
year = {2007}
}
Comments
Version dated 1985; GNU FDL