SCHOOL OF ADVANCED SCIENCES

DEPARTMENT OF MATHEMATICS
WIMTER SEMESTER – 2021∼2022
MAT1016 – Applied Discrete Mathematical Structures
A1+TA1+TAA1+V1 Slot
DIGITAL ASSIGNMENT – II

Instructions:

(i). Last Date for Submission of Digital Assignment II (DA-II) : 25th March 2022.

(ii). Mention the Register Number, Name, Slot Details, Course Code and Course Title in the
First Page of the Assignment. Also mention the Register Number and Name in every

T
page of the document.

VI
Answer ALL the Questions–
S
SA

1. Show that the number of edges in a simple graph with n vertices is at-most
n n(n − 1)
C2 = .
s–

2
ic

2. Find out all the edge-disjoint Hamiltonian circuits of the complete graph with 9 vertices
at

(K9 ).
m

3. Apply the Dijkstra’s algorithm to find the shortest path between the vertices a and z in the
he

following weighted graph and hence compute the total weight of the obtained shortest
at

path between the mentioned vertices.

M
4. Find the minimal spanning tree by using the Prim’s algorithm for the following weighted
graph and hence calculate the total weight of the obtained minimal spanning tree.

5. Write the Detailed Report on Applications of Graphs in Science, Engineering, or

Technology Oriented Problems for minimum 1 page.

**********

T
VI
–
S
SA
s–
ic
at
m
he
at
M

Page 2