#Graph Theory
12 messages · Page 1 of 1 (latest)
@gray chasm
yes
yo u still need help?
(i) Use eulers handshaking lemma
(ii) just use ur brain and draw it
(iii) you'd have a loop with one of the vertice, so you'd violate the simple property
(iv)
(a) 3 vertices of order 4 makes 12 vertices, which is even, but as there's 5, you'd need extra ways to connect the vertices, so it'd be odd and can't be Eulerian
(b) one vertex of order 0, one of order 2 and two of order 4
then draw these
Yh