Graph Theory By Narsingh Deo Exercise Solution -

In graph theory, there is no royal road to Eulerian paths, only the patient traversal of edges. Happy graphing.

We need a graph with 5 vertices. Let degrees be: $d(v_1)=3, d(v_2)=3, d(v_3)=2, d(v_4)=2, d(v_5)=2$. Sum of degrees = $3+3+2+2+2 = 12$. By Handshaking Lemma, $2|E| = 12 \Rightarrow |E| = 6$. Graph Theory By Narsingh Deo Exercise Solution

Trees are acyclic connected graphs. The exercises here focus on properties and counting. A tree with vertices has exactly In graph theory, there is no royal road

Solution: