Turán graph
complete multipartite graph for partitions whose sizes are as equal as possible
edgeless graph
graph without edges (on any number of vertices)
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