0
$\begingroup$

I have found the proof that if G is a simple graph with order $n\geq 2$ then there are at least two vertices in $V(G)$ that have equal degree. Does this statement extend to non-simple graphs? If so, how do I go about proving it? Thank you

$\endgroup$
2
$\begingroup$

Suppose you construct a graph with three vertices $a,b,c$.

$a$ is having a self loop and is connected to $b$, $b$ is having a self loop and connected to $c$.

Degree($a$) =$ 3$, Degree($b$) =$ 4$, Degree($c$) =$1$

$\endgroup$

Your Answer

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

Not the answer you're looking for? Browse other questions tagged or ask your own question.