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.
G ≔ Graph⁡Trail⁡1,2,3,4,2,5,6,7,2,8,1
G≔Graph 1: an undirected unweighted graph with 8 vertices and 10 edge(s)
Download Help Document
What kind of issue would you like to report? (Optional)