threshold graph
graph that can be constructed with a sequence of operations that add either an isolated vertex or a dominating vertex
cricket graph
graph with 5 vertices and 5 edges
edgeless graph
graph without edges (on any number of vertices)
paw graph
graph with 4 vertices and 4 edges
star graph
node-link graph in which one central node is the only neighbor of all the other nodes
moth graph
graph with 6 vertices and 7 edges
complete graph
simple undirected graph in which every pair of distinct vertices is connected by a unique edge
diamond graph
graph with 4 vertices and 5 edges