Graph Theory By Narsingh Deo Exercise Solution May 2026

While there is no single official "Solution Manual" published by Narsingh Deo, comprehensive exercise solutions for Graph Theory with Applications to Engineering and Computer Science are available through several academic and community platforms. Where to Find Solutions

• Use induction on n.
• Base: n=1 edge count 0 → 1-1=0.
• Inductive step: Remove a leaf (vertex of degree 1) and its incident edge. The remaining graph is a tree with n-1 vertices, (n-1)-1 = n-2 edges by hypothesis. Add back leaf and edge → total edges = (n-2)+1 = n-1.

: Some engineering colleges provide "Question Banks" or study materials that include answers to common problems derived from Deo's text for their specific curriculums, such as those from Jeppiaar Engineering College Jeppiaar – Engineering College Core Topics Covered in Exercises Graph Theory By Narsingh Deo Exercise Solution

• “Prove or disprove…”
• “Find necessary and sufficient condition…”
• “Show that if G is a tree, then…”

Introduction to Graph Theory

Solution: Proof: Let $G = (V, E)$ be a graph with $n$ vertices and $e$ edges. Every edge in a graph connects two vertices (or a vertex to itself in a loop). Therefore, every edge contributes 2 to the total sum of degrees. While there is no single official "Solution Manual"

Perhaps the greatest value in solving Deo's exercises is the exposure to classical algorithms in their native environment. Problems revolving around the shortest path (Dijkstra’s or Warshall’s algorithms), flow problems, and traveling salesman approximations are heavily featured. Use induction on n

Happy graphing. And remember: In graph theory, as in life, there is always more than one path to the solution.