Maulana Azad National Institute of Technology Bhopal
Department of Mathematics, Bioinformatics and Computer Applications
Subject: Graph Theory and Algorithms Assignment #5 Subject Code: MDS-322/ BI24524
Notations: All the notations used have a standard usual meaning corresponding to concepts.
1. (a) Prove that a graph G is a tree if and only if it is loopless and has exactly one spanning
tree.
(b) Determine whether the following statement is true or false. Justify your answer with a formal
proof or provide a counterexample.
“Every graph with fewer edges than vertices contains at least one component that is
a tree.”
2. Build a binary search tree for the words oenology, phrenology, campanology, ornithology, ichthyol-
ogy, limunology, alchemy, and astrology using alphabetical order.
3. Consider the rooted tree T shown below:
B C
D E F G
H I J K L M N O
Question: Answer the following based on the tree T :
a) Identify the root, leaves, and internal nodes of the tree.
b) What is the height of the tree?
c) Determine the depth of node I in the tree.
d) Write a preorder, inorder, and postorder traversal of the tree.
4. Consider the undirected tree T shown below:
B C
D E F
a) Compute the eccentricity of each vertex in the tree.
b) Determine the radius and the diameter of the tree.
c) Identify the center(s) of the tree.
d) Justify whether the center is unique or not. If not, explain why.
1
5. Let T be a minimum weight spanning tree in a weighted connected graph G. Prove that T omits
some heaviest edge from every cycle in G.
6. Consider the following undirected connected graph G:
A B D
a) Determine the number of distinct spanning trees of the graph G.
b) Show your work by listing all possible spanning trees or using a suitable method.
c) Is it possible to remove an edge from G such that the number of spanning trees remains the
same? Justify your answer.
7. Consider the following connected, undirected, weighted graph G:
4 2
A B C
5 1 3 7
D E
6
a) Use Prim’s Algorithm starting from vertex A to find the minimum spanning tree. Show the
step-by-step selection of edges and vertices.
b) Use Kruskal’s Algorithm to find the minimum spanning tree of the same graph. Show the
edge selection process in sorted order.
c) What is the total weight of the minimum spanning tree obtained by both algorithms?
d) Are the MSTs obtained by both methods the same? If not, explain how they differ.
8. The undirected, connected, weighted graph G below contains edges with the same weights, allowing
for multiple minimum spanning trees. Analyze the structure using both algorithms.
4 2
A B C
6 3 5 4
D E
7
3 2
2
a) Apply Prim’s Algorithm starting from vertex A and record the sequence of selected edges.
b) Apply Kruskal’s Algorithm, listing the edges in non-decreasing order of weights, and con-
struct the MST step by step.
c) Compare the two MSTs obtained. Are they identical? If not, list both MST edge sets.
9. Let T be the tree from Problem 10.
a) What is the minimum number of colors needed to properly color the tree T ?
b) Prove that every tree is 2-colorable.
c) Provide a valid 2-coloring of the given tree.
10. Consider the undirected graph G below:
A B C
D E
a) Find all minimum dominating sets of the graph G.
b) Prove that any dominating set must include at least one of the middle vertices.
c) Is the dominating set unique? Explain.
11. Consider the undirected graph G given below:
B E
A C
D F
a) Find all maximal independent sets in the graph G.
b) What is the size of a maximum independent set?
c) Prove that any maximum independent set in this graph must exclude all adjacent vertices.
12. Let 5, 2, 15, 9, 0, 3, 10, 13, and 4 be a sequence of integers no two of which are the same. By using
the tree graph, find the longest monotonically increasing subsequences.
13. Find a minimum spanning tree for the given graphs using Kruskal’s and Prim’s algorithms. Is the
obtained minimum spanning tree unique, and why? Also, estimate the time and space complexity
for both the algorithms.
3
Figure 1: Minimum spanning tree
Figure 2: The minimum spanning tree of the graph
