Assignment 1

Graph Theory and Applications

Q1. Discus The Gale-Shapley theorem with example.

Q2. Run Prim’s and Kruskal’s algorithm on following graph to find minimum cost spanning
tree. Also list all possible minimum cost spanning trees. In the following graph.

Q3. If a planner graph, having 25 vertices divides the plane into 17 different regions. Then
how many edges are used to connect the vertices in this graph?
Q4. In a connected 3 regular graph, every planar region is bounded by exactly 5 edges, then
count no of edges?
Q5. Let G be a weighted undirected graph and e be an edge with maximum weight in G.
Suppose there is a minimum weight spanning tree in G containing the edge e. Which of the
following statements are true and false? Also discuss why?
(A) There exists a cutset in G having all edges of maximum weight.
(B) There exists a cycle in G having all edges of maximum weight
(C) Edge e cannot be contained in a cycle.
(D) All edges in G have the same weight