A graph G is defined with vertices V and edges E. The minimum degree delta(G) and maximum degree delta(G) represent the lowest and highest number of edges connected to any single vertex in the graph G. The degrees are related such that the minimum degree must be less than or equal to the average degree of G, which must be less than or equal to the maximum degree.