bipartite graph
graph whose vertices can be divided into two disjoint and independent sets
crown graph
type of graph
Herschel graph
bipartite undirected graph
Gray graph
undirected bipartite graph with 54 vertices and 81 edges
Watkins snark
a snark with 50 vertices and 75 edges
semi-symmetric graph
graph that is edge-transitive and regular but not vertex-transitive
half graph
type of graph in mathematics
Ljubljana graph
undirected bipartite graph with 112 vertices and 168 edges
Desargues graph
highly symmetric graph with 20 vertices and 30 edges
Franklin graph
graph often embedded on the Klein bottle
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
knight's graph
graph that represents all legal moves of the knight on a chessboard
hypercube graph
graphs formed by a hypercube's edges and vertices
Folkman graph
graph with 20 vertices and 40 edges, the smallest semi-symmetric graph
Nauru graph
node-link graph with 24 vertices, one of seven symmetric generalized Petersen graphs
Walther graph
planar graph with 25 vertices and 31 edges
modular graph
in graph theory, an undirected graph in which every three vertices x, y, and z have at least one median vertex m(x, y, z) that belongs to shortest paths between each pair of x, y, and z
complete bipartite graph
every vertex of first set attached to every vertex of second set
Dyck graph
node-link graph, the only cubic symmetric graph on 32 vertices
Hoffman graph
4-regular graph with 16 vertices and 32 edges
factor graph
bipartite graph representing the factorization of a function
ladder graph
planar undirected graph with 2n vertices and 3n-2 edges; the Cartesian product of two path graphs, one of which has only one edge
chordal bipartite graph
bipartite graph where every cycle of length at least 6 has a chord
Petri net
family of modelling languages for distributed systems