I just didn't understand the second part of the prove
"G has twice as many edges as vertices only "... what do I actually have to prove ?
I understand it like $n=2e$ , is it right ?
then isn't it's just similar to the degree equation ??
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.Sign up to join this community