vertex-transitive graph
graph whose automorphism group acts transitively upon its vertices
prism graph
graph with a prism as its skeleton
distance-transitive graph
graph where any two nodes of equal distance are isomorphic
Franklin graph
graph often embedded on the Klein bottle
Wells graph
5-regular graph with 32 vertices and 80 edges
Johnson graph
class of undirected graphs defined from systems of sets
Wagner graph
cubic graph with 8 vertices and 12 edges
symmetric graph
type of graph which admit an automorphism on adjacent vertices
cycle graph
graph that consists of a single cycle
rook's graph
graph that represents all legal moves of the rook chess piece on a chessboard
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
Gewirtz graph
strongly regular graph with 56 vertices and valency 10
truncated tetrahedral graph
graph with 12 vertices and 18 edges
half-transitive graph
graph that is both vertex-transitive and edge-transitive, but not symmetric