Scribd
Upload
33 views4 pages

MFC-1 Tutorial 10-11-12 Unit 4

The document outlines tutorial exercises for first-year B. Tech students at MIT ADT University, focusing on mathematical foundations for computing. It includes problems on graph theory, such as handshaking lemma, isomorphism, Dijkstra’s algorithm, and Hamiltonian circuits. The tutorials aim to enhance understanding of graph properties and algorithms through practical applications.

Uploaded by

lopesjason007
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 views4 pages

MFC-1 Tutorial 10-11-12 Unit 4

The document outlines tutorial exercises for first-year B. Tech students at MIT ADT University, focusing on mathematical foundations for computing. It includes problems on graph theory, such as handshaking lemma, isomorphism, Dijkstra’s algorithm, and Hamiltonian circuits. The tutorials aim to enhance understanding of graph properties and algorithms through practical applications.

Uploaded by

lopesjason007
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/ 4

MIT ADT University, Pune

MIT Art Design and Technology University’s


MIT School of Computing, Pune
Department of Applied Science & Humanities
First Year B. Tech. (All Branches)
23ASH1103: Mathematical Foundation for Computing -I
Tutorial No.:10
State handshaking lemma. How many nodes are necessary to construct a graph with exactly
1
8 edges in which each node is of degree 2.
Is it possible to construct a graph with 12 vertices such that 2 of the vertices have degree 3
2
and the remaining vertices have degree 4?
Determine the number of edges in a graph with 6 vertices, 2 of degree 4 and 4 of degree 2.
3
Draw two such graphs.
What is isomorphism of graph? Identify the following graph are isomorphic or not justify
your answer.

Whether that the following graphs are isomorphic?

Define Isomorphic Graphs. Check whether the following graphs G1 and G2 are isomorphic
or not.

6
MIT ADT University, Pune

Tutorial No.:11
Use Dijkstra’s algorithm to find the shortest path between ‘a’ and ‘z’ in the following
figure.

Use Dijkstra’s algorithm to find the shortest path between ‘a’ and ‘e’ in the following figure.

Find the shortest path from S to all other vertices of the given graph using Dijkstra’s
algorithm.

Determine which of the graph below represents Eulerian circuit, Eulerian path, Hamiltonian
circuit and Hamiltonian Path. Justify your answer.

G1 G2
MIT ADT University, Pune

Determine which of the following graphs G1 and G2 represents Eulerian circuit, Eulerian
path, Hamiltonian circuit and Hamiltonian path. Justify your answer.

𝑮𝟐
Justify whether the graphs contain the following properties. If yes, write the path and
circuit.
(i) Euler path (ii) Euler circuit (iii) Hamiltonian path (iv) Hamiltonian circuit.

Tutorial No.:12
Use Nearest Neighbor Method to find out Hamiltonian Circuit for the following graph.
(a) Starting at vertex ‘a’.
(b) Starting at vertex ‘d’
(c) Determine the minimum Hamiltonian Circuit.

Use nearest -neighbour method to find the Hamiltonian circuit starting from ‘a’ in the
2
following graph. Find its weight.
MIT ADT University, Pune

Use nearest -neighbour method to find the Hamiltonian circuit starting from ‘A’ in the
following graph. Find its weight.

A connected planar graph has nine vertices having degrees 2, 2, 2, 3, 3, 3, 4, 4 and 5. How
4
many edges are there? How many regions are there?
Let G be a planar graph with 10 vertices, 3 components and 9 edges. Find the number of
5
regions in G.
Let G be a connected planar simple graph with 20 vertices and degree of each vertex is 3.
6
Find the number of regions in G.

You might also like