Scribd
Upload
11 views

Tutorial 10,11,12

hj

Uploaded by

mukalagovind2
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
11 views

Tutorial 10,11,12

hj

Uploaded by

mukalagovind2
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Department of Mathematics

24MT1002: Discrete Mathematics


I/IV-B. Tech-(ODD Sem), Academic Year: 2024-2025

TUTORIAL PROBLEMS-CO-4
TUTORIAL-10

1. Is there a simple graph with degree sequence (1,1,3,3,3,4,6,7)? Justify your answer.

2. Determine whether the following graph is a simple graph or multigraph, and obtain the
adjacency matrix.

a. b

[ ]
1 1 1 0
0 0 1 0
3. Draw a graph with the adjacency matrix with respect to the ordering of the
1 0 1 0
1 1 1 0
vertices a, b, c, d.
4. Check whether the graph H displayed are bipartite or not?

5. Check whether the graphs are isomorphic or not?


a

i.
B.

TUTORIAL-11
1. which of the following graphs have Euler circuit, then construct such graph if exist.

2. Which of the following graphs have Hamilton circuit or Hamilton path, and then
construct such graph if exist.
3. Which of these non-planar graphs have the property that the removal of any vertex and
all edges incident with that vertex produces with planar graph?
a) K6 b) K3, 3
4. Determine whether the given graph is planar. If so, draw it so that no edges cross.

a. b.

5. Determine all spanning trees of the graph G shown in the following Figure.

a.

TUTORIAL-12

1. Construct all possible spanning trees of the graph H shown in the following Figure.

2. Apply Kruskal’s Algorithm to construct the minimum spanning tree (MST) from the
following graph.
3. Apply Kruskal’s Algorithm to construct the minimum spanning tree (MST) from the
following graph.

You might also like