Vertex and Edge Transitive, but not 1-Transitive, Graphs
Vertex and Edge Transitive, but not 1-Transitive, Graphs
A (simple, undirected) graph G is vertex transitive if for any two vertices of G there is an automorphism of G that maps one to the other. Similarly, G is edge transitive if for any two edges [ a , b ] and [ c , d ] of G …