Let G be a graph with v vertices and e edges. Let M be the
Chapter , Problem 52E(choose chapter or problem)
Problem 52E
Let G be a graph with v vertices and e edges. Let M be the maximum degree of the vertices of G, and let m be the minimum degree of the vertices of G. Show that
a) 2e/v ≥ m.
b) 2e/v ≤ M.
A simple graph is called regular if every vertex of this graph has the same degree. A regular graph is called n-regular if every vertex in this graph has degree n.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer