Complete Bipartite Graphs
A graph is a complete bipartite graph if and only if it has vertices, where the vertices are split into two sets, with vertices in each set. Every vertex of the first set is adjacent to every vertex of the second set, but no vertex is adjacent to another vertex in its same set.