Question: In a group of people, some are friends. Represent this scenario where an edge exists if two people are friends. Is the graph directed or undirected? Solution: Friendship is typically mutual, so the graph is undirected . If the relationship were "follows" or "likes," it would be directed (digraph).
Many computer science students and teaching assistants have uploaded their to GitHub. Search for repositories with titles like: Graph Theory By Narsingh Deo Exercise Solution
Graph Theory with Applications to Engineering and Computer Science Question: In a group of people, some are friends
: This is an excellent resource for competitive exam aspirants. It contains detailed discussions and verified solutions for specific problems (e.g., Problem 2-18) from the book. Solution: Friendship is typically mutual, so the graph
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.