Cayley graph
graph whose vertices and edges represent the elements of a group and their products with the generators of the group
Kummer graph
graph with 32 vertices and 96 edges
Sylvester graph
5-regular graph with 36 vertices and 90 edges
prism graph
graph with a prism as its skeleton
Wells graph
5-regular graph with 32 vertices and 80 edges
Poussin graph
graph with 15 vertices and 39 edges
Holt graph
graph with 27 vertices and 54 edges, the smallest half-transitive graph
Nauru graph
node-link graph with 24 vertices, one of seven symmetric generalized Petersen graphs
Dyck graph
node-link graph, the only cubic symmetric graph on 32 vertices
zero-symmetric graph
connected graph in which each vertex has exactly three incident edges and, for each two vertices, there is a unique symmetry taking one vertex to the other
pancake graph
graph whose vertices are the permutations of n symbols from 1 to n and its edges are given between permutations transitive by prefix reversals
Hamming graph
cartesian product of isomorphic complete graphs
circulant graph
undirected graph acted on by a vertex-transitive cyclic group of symmetries