regular graph
graph where each vertex has the same number of neighbors
Foster cage
5-regular graph with 30 vertices and 75 edges
crown graph
type of graph
Klein graph
two different but related regular graphs
Kummer graph
graph with 32 vertices and 96 edges
Wong graph
5-regular graph with 30 vertices and 75 edges
semi-symmetric graph
graph that is edge-transitive and regular but not vertex-transitive
quartic graph
graph in which every vertex is incident to exactly four edges
vertex-transitive graph
graph whose automorphism group acts transitively upon its vertices
cage
regular graph that has as few vertices as possible for its girth
cubic graph
graph in which every vertex is incident to exactly three edges
Fritsch graph
planar graph with 9 vertices and 21 edges
walk-regular graph
spectral graph theory analogue of vertex-transitive graphs
Ramanujan graph
spectral graph theory concept
Wells graph
5-regular graph with 32 vertices and 80 edges
Johnson graph
class of undirected graphs defined from systems of sets
wheel graph
graph formed from a cycle graph by adding a new vertex adjacent to all the vertices in the cycle
Hall Graph
10-regular graph with 65 vertices and 325 edges
Platonic graph
graph with a Platonic solid as its skeleton
strongly regular graph
graph in which the number of shared neighbors of two vertices depends only on whether they are adjacent
cycle graph
graph that consists of a single cycle
Moore graph
largest possible regular graph for its diameter
lattice graph
graph that can be drawn within a repeating arrangement of points
rook's graph
graph that represents all legal moves of the rook chess piece on a chessboard
Archimedean graph
graph that forms the skeleton of one of the Archimedean solids
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
McLaughlin graph
strongly regular graph with 275 vertices and 15400 edges