: 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
are not officially published as a standalone manual by the author or original publisher. Instead, students and educators typically rely on a combination of peer-sourced documents and community discussion platforms Available Resources for Exercise Solutions Crowdsourced Platforms
"Proof Mapper & Counter-Example Explorer"
-vertex graph, at least one vertex is repeated, proving a circuit exists.
: Prove that every tree with two or more vertices has at least two pendant (degree 1) vertices. Graph Theory By Narsingh Deo Exercise Solution
is in a circuit, removing it leaves the rest of the circuit as an alternative path, meaning the graph remains connected. Chapter 5: Vector Spaces of Graphs
Graph Theory with Applications to Engineering and Computer Science by Narsingh Deo is a foundational textbook for students of mathematics, computer science, and engineering. First published in 1974, this seminal work remains a staple in academic curricula worldwide due to its rigorous yet accessible approach to abstract mathematical concepts.
: Tree proofs almost always rely on Mathematical Induction on the number of vertices ( ) or edges ( 3. Cut-Sets and Cut-Vertices (Chapter 4)
Here are detailed, step-by-step walkthroughs of typical problem types found in Narsingh Deo's exercises. Problem 1: Proving Tree Edge Count Prove by induction that a tree with vertices has exactly Base Case: Let . A tree with 1 vertex has 0 edges. . The base case holds true. : Some engineering colleges provide "Question Banks" or
Chromatic number and graph matching.
Chapter 6 & 7: Vector Spaces of Graphs and Matrix Representation
Narsingh Deo’s Graph Theory is a staple text for computer science and engineering students. Its exercises range from simple identification of properties to complex proofs involving planarity, coloring, and isomorphism. Below is a selection of solved exercises and conceptual approaches to common problems found in the text, organized by chapter.
Solving Narsingh Deo’s exercises is the primary way to gain "graphical literacy." While the theorems provide the rules, the exercises teach the language of computer science—modeling real-world networks, circuits, and data structures as discrete mathematical objects. If you'd like to work through a specific problem: or topic (e.g., Trees, Planar Graphs) Exercise number Specific theorem you are struggling to apply is in a circuit, removing it leaves the
If you get stuck on a specific exercise and cannot find the solution online, try these strategies:
Many computer science students have uploaded repository scripts translating Narsingh Deo's algorithms (like Kruskal's, Prim's, or Dijkstra's) into Python or C++. For theoretical proofs, the Mathematics Stack Exchange and Computer Science Stack Exchange feature thousands of answered threads detailing these exact textbook exercises.
Mastering Graph Theory: A Comprehensive Guide to Narsingh Deo’s Solutions
Almost every chapter has a problem solvable by the fundamental theorem that the sum of degrees is twice the number of edges. 💡 Core Insight
) is the most powerful proof technique for tree-related exercises. For spanning trees, practice the Matrix Tree Theorem for larger graphs. Chapter 5: Planar and Dual Graphs