Scribd
Upload
33 views

Assignment 2

The document is an assignment on graph theory covering topics like finding minimum spanning trees using Prim's and Kruskal's algorithms, shortest paths using Dijkstra's and Floyd-Warshall algorithms, planar graphs and their properties, and applications of planar graphs. It contains 10 questions worth a total of 30 marks assessing skills such as finding the maximum number of vertices in a binary tree, labeling graph vertices with eccentricities, applying Kruskal's algorithm, proving properties of spanning trees, defining cut-sets and proving their properties, defining planar and non-planar graphs, and more.

Uploaded by

binnytmz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
33 views

Assignment 2

The document is an assignment on graph theory covering topics like finding minimum spanning trees using Prim's and Kruskal's algorithms, shortest paths using Dijkstra's and Floyd-Warshall algorithms, planar graphs and their properties, and applications of planar graphs. It contains 10 questions worth a total of 30 marks assessing skills such as finding the maximum number of vertices in a binary tree, labeling graph vertices with eccentricities, applying Kruskal's algorithm, proving properties of spanning trees, defining cut-sets and proving their properties, defining planar and non-planar graphs, and more.

Uploaded by

binnytmz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

St.

Thomas Institute for Science & Technology


Department of Computer Science and Engineering
Assignment -2, March 2024
Date of Submission:
Sem: IV
Course Code: MAT 206 15/04/2024
Date of Course Name: GRAPH THEORY
Max. Marks: 30
Issue:22/03/2024
After completion the assessment students will be able to
Illustrate the working of Prim’s and Kruskal’s algorithms for finding minimum cost spanning tree and
CO 3
Dijkstra’s and Floyd-Warshall algorithms for finding shortest paths.
CO 4 Explain planar graphs, their properties and an application for planar graphs.

CO- Course Outcome, Cognitive Level (Bloom’s Taxonomy Level (B.L) :(L1- Remember, L2- Understand, L3
– Apply, L4 – Analyze, L5 – Evaluate and L6– Create)
Q. No Questions Marks CO B L

L3
Find the maximum number of vertices possible in a 3-level binary tree. Also
1 3 CO3 &
find the maximum height possible in a binary tree with 11 vertices.
L4

Label the vertices of the following graph with their eccentricities and hence
find the diameter and centre of the gra
L3
2 3 CO3 &
L4

Define center of a graph. Find the center of the following graph


L3
3
3 CO3 &
L4

Apply Kruskal’s algorithm to find the minimal spanning tree for the following
weighted graph

L3
4 3 CO3 &
L4

Page 2 of 4
.
For any spanning tree of a connected graph with n vertices and e edges, prove
that there are 𝑛 − 1 tree branches and 𝑒 − 𝑛 + 1 chords. For the following
graph find two spanning trees and hence show that an edge that is a branch of
one spanning tree can be a chord with respect to another spanning tree of same
graph.
L3
5 3 CO3 &
L4

L3
Define cut-set. Prove that every circuit in G has an even number of edges in
6 3 CO4 &
common with any cut-set.
L4
L3
7 Define planar graph and non-planar graph with examples. 3 CO4 &
L4
Define edge connectivity, vertex connectivity separable and non-separable graph. L3
8 Give an example for each. 3 CO4 &
L4
Illustrate the statement: “The ring sum of any two cut-sets in a graph is either a third
cut-set or an edge disjoint union of cut-sets”, in the following graph.

L3
9 3 CO4 &
L4

Find a spanning tree and hence find all fundamental cut sets, associated with it, of
the following graph.

L3
10 3 CO4 &
L4

Page 3 of 4

You might also like