symmetric graph
type of graph which admit an automorphism on adjacent vertices
Klein graph
two different but related regular graphs
Kummer graph
graph with 32 vertices and 96 edges
Sylvester graph
5-regular graph with 36 vertices and 90 edges
Cameron graph
strongly regular graph with 231 vertices and 3465 edges
Desargues graph
highly symmetric graph with 20 vertices and 30 edges
Coxeter graph
cubic distance-regular graph with 28 vertices and 42 edges
distance-transitive graph
graph where any two nodes of equal distance are isomorphic
Rado graph
infinite graph containing all countable graphs
halved cube graph
graph whose vertices are binary numbers with even numbers of nonzero bits and whose edges connect closest pairs in Hamming distance
Foster graph
bipartite 3-regular graph with 90 vertices and 135 edges
Pappus graph
graph with 18 vertices and 27 edges, formed as the Levi graph of the Pappus configuration
hypercube graph
graphs formed by a hypercube's edges and vertices
odd graph
family of symmetric graphs which generalize the Petersen graph
Platonic graph
graph with a Platonic solid as its skeleton
Nauru graph
node-link graph with 24 vertices, one of seven symmetric generalized Petersen graphs
Meredith graph
4-regular undirected graph with 70 vertices and 140 edges
Dyck graph
node-link graph, the only cubic symmetric graph on 32 vertices
Laves graph
periodic spatial graph
complete graph
simple undirected graph in which every pair of distinct vertices is connected by a unique edge
double-star snark
graph with 30 vertices and 45 edges