A 27-vertex graph that is vertex-transitive and edge-transitive but not l-transitive
classification
🧮 math.CO
keywords
graphedge-transitivevertexvertex-transitiveautomorphismsdescribeedge-reversingedges
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.