complete graph
simple undirected graph in which every pair of distinct vertices is connected by a unique edge
triangle graph
complete graph on 3 vertices
singleton graph
graph consisting of only one vertex and no edges
tetrahedral graph
complete graph on 4 vertices
order-zero graph
the unique graph having no vertices
clique
subset of the vertices of a node-link graph that are all adjacent to each other
tournament
directed graph in which each pair of vertices are the endpoints of one edge