minimum degree

The minimum vertex degree, sometimes simply called the minimum degree, of a graph G is the smallest vertex degree of G, denoted δ. It is a well known consequence of the Euler theorem that a planar graph has δ<=5. Fabrici and Madaras showed that a 1-planar graph has δ<=7.

maximum vertex degree | vertex degree