Graphs

Simple Graph - No loops, and no multiple edges. (Represented as K_n)
Complete Graph - A simple graph with as many edges as possible.
Sub Graph - A graph H is called a subgraph of graph G if the vertices of H are also vertices of G, and the edges of H are also edges of G.
Null Graph - All vertices, no edges.
Planar Graph - Graph drawn with no edges 'crossing'
Cycle Graph - Every vertex has exactly 2 edges.
Bipartite Graph - Separated into 2 sets of vertices, each vertex in one set is connect to each other vertex in the other set. Edges calculated: If K_m,n then edges are mn