MaximumDegree returns the largest degree of the graph.

MinimumDegree returns the smallest degree of the graph.

A graph is regular if its minimum degree is equal to its maximum degree.

$\mathrm{with}\left(\mathrm{GraphTheory}\right)\:$

$G≔\mathrm{Graph}\left(\mathrm{Trail}\left(1\,2\,3\,4\,2\,5\,6\,7\,2\,8\,1\right)\right)$

$G≔\mathrm{Graph\; 1:\; an\; undirected\; unweighted\; graph\; with\; 8\; vertices\; and\; 10\; edge(s)}$

$\mathrm{MaximumDegree}\left(G\right)$

$6$

$\mathrm{MinimumDegree}\left(G\right)$

$2$

$\mathrm{DrawGraph}\left(G\right)$