edge-transitive graph
graph whose automorphism group acts transitively upon its edges
semi-symmetric graph
graph that is edge-transitive and regular but not vertex-transitive
Wells graph
5-regular graph with 32 vertices and 80 edges
symmetric graph
type of graph which admit an automorphism on adjacent vertices
star graph
node-link graph in which one central node is the only neighbor of all the other nodes
cycle graph
graph that consists of a single cycle
Gewirtz graph
strongly regular graph with 56 vertices and valency 10
half-transitive graph
graph that is both vertex-transitive and edge-transitive, but not symmetric