Show that $m \le 2e/v \le M$

$\begingroup$

$G$ be a graph with $v$ vertices and $e$ edges.Let $M$ be maximum degree of the vertices of $G$, and let $m$ be the minimum degree of the vertices $G$.Show that $$m \le 2e/v \le M$$

I am completely stuck on this problem .please help me.

$\endgroup$

1 Answer

$\begingroup$

Let $V$ be the set of vertices. We have, $mv \leq \sum_{u\in V} deg(u) \leq Mv$, since $m \leq deg(u) \leq M$ for all $u$ . But $\sum_{u\in V} deg(u) = 2e$. Therefore, $mv \leq 2e \leq Mv$ and thus $m \leq \frac{2e}{v} \leq M$.

$\endgroup$

Your Answer

Sign up or log in

Sign up using Google Sign up using Facebook Sign up using Email and Password

Post as a guest

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

You Might Also Like