Strategy : The dimension of the circuit subspace (rank) is given by is the number of connected components. Chapter 6: Matrix Representation of Graphs
10≤3(5)−610 is less than or equal to 3 open paren 5 close paren minus 6 10≤15−610 is less than or equal to 15 minus 6 10≤9(False)10 is less than or equal to 9 space (False) Because it violates the planar edge bound, K5cap K sub 5 cannot be embedded in a plane without intersecting edges. 4. Best Practices for Solving Unsolved Problems
is often the first course where computer science and mathematics students encounter the beauty of discrete structures. Among the pantheon of textbooks, "Graph Theory with Applications to Engineering and Computer Science" by Narsingh Deo remains a timeless classic. First published in 1974, its clarity, depth, and rigorous problem sets continue to challenge and shape learners worldwide.
For long-term learning (or if you’re an instructor), consider:
: Graph-theoretic algorithms, switching and coding theory, and electrical network analysis. Free Book Centre.net Do you have a specific chapter or problem number you are currently working on? Graph Theory by Narsingh Deo Exercise Solution - Scribd Graph Theory By Narsingh Deo Exercise Solution
The lack of an official, comprehensive solution manual is a significant point of discussion in the graph theory community. Many reviews and forum posts echo the sentiment of a frustrated reader on Douban.com, who noted that the provided answers were either absent or not helpful, complaining, “The hints given are as good as none”.
Deo often introduces a theorem, then asks you to prove a corollary in the exercises. Read the section carefully—the proof technique is usually hinted at nearby.
It’s important to know upfront that . This is a common situation with classic textbooks. Therefore, your search will involve finding "crowdsourced" solutions and study aids instead of a single master document.
Covers everything from basic definitions to complex algorithms like Dijkstra's algorithm for shortest paths. Strategy : The dimension of the circuit subspace
However, every student who has journeyed through Deo’s chapters knows a universal truth: the exercises are formidable. This article serves as a comprehensive roadmap for anyone searching for —not as a shortcut to copy answers, but as a guide to understanding the methodology, finding reliable resources, and mastering the subject.
While an official solutions manual was never widely published for the general public, several student-led and academic resources provide detailed answers:
Graph theory is not a passive subject; mastery requires active problem-solving. Narsingh Deo’s exercises are carefully structured to transition students from basic computational mechanics to advanced mathematical proofs. Working through these solutions helps you develop:
If you are building a study guide, you should focus on these high-yield areas from the book: Dijkstra’s Algorithm (Chapter 11) – Finding the shortest path. Kruskal’s vs. Prim’s (Chapter 3) – Minimum spanning tree construction. Matrix Representation (Chapter 7) – Adjacency vs. Incidence matrices. (Chapter 5) – Using Euler’s formula ( or a particular from the book? Best Practices for Solving Unsolved Problems is often
Cut-sets measure the vulnerability and connectivity of networks. The exercises here require computing minimal isolating sets and analyzing vertex connectivity.
Your solution must include a clear diagram showing a tree with one bridge edge labeled, and a cycle graph (e.g., (C_3)) showing a non-bridge.
Question: A connected planar graph has 6 vertices and 10 edges. How many regions does it have? Solution:
Translating visual graphs into computation-friendly matrices (Incidence, Adjacency, Circuit, and Cut-set matrices). : Properties of the Adjacency Matrix ( ) and Incidence Matrix ( Sample Problem Approach : Show that the -th entry of Arcap A to the r-th power represents the number of walks of length from vertex Strategy : Prove via mathematical induction on
If you are stuck on a specific exercise from the textbook, use this diagnostic workflow: