Scribd
Upload
5 views7 pages

Tutorial 4

This document outlines an assignment for the B. Tech. Discrete Mathematics course at Parul University for the academic year 2023-24. It includes various tasks related to undirected and directed graphs, such as finding vertices and edges, verifying the Handshaking Theorem, drawing graphs, and determining properties like isomorphism and connectivity. Additionally, it covers concepts like Euler and Hamiltonian paths, spanning trees, and minimum spanning trees using Prim’s and Kruskal’s algorithms.

Uploaded by

u695788
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
5 views7 pages

Tutorial 4

This document outlines an assignment for the B. Tech. Discrete Mathematics course at Parul University for the academic year 2023-24. It includes various tasks related to undirected and directed graphs, such as finding vertices and edges, verifying the Handshaking Theorem, drawing graphs, and determining properties like isomorphism and connectivity. Additionally, it covers concepts like Euler and Hamiltonian paths, spanning trees, and minimum spanning trees using Prim’s and Kruskal’s algorithms.

Uploaded by

u695788
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/ 7

PARUL UNIVERSITY

FACULTY OF ENGINEERING AND


TECHNOLOGY
B. TECH. PROGRAMME (3rd SEM)
(CSE/ IT)DISCRETE
MATHEMATICS (303191202)
ACADEMIC YEAR 2023-24
ASSIGNMENT -4

1 Find the number of vertices, number of edges, and degree of each vertex in the Following
Undirected graphs. Identify all isolated and pendant vertices

2 Find the number of vertices, number of edges, and degree of each vertex in the Following
undirected graphs and hence, verify the Handshaking Theorem for each one
3 Find the number of vertices, number of edges, in-degree and out-degree of each vertex
in the following directed graphs and hence, verify that the sum of in-degrees, the sum
of out degrees of the vertices and the number of edges in the following graphs are
equal.

(a) (b) (c)

(d) (e)

4 Draw the graphs: 𝐾7, 𝐾1,8 , 𝐾4,4 , 𝐶7, 𝑊7, 𝑄4


5 Represent the following graphs using adjacent matrices:
(a) (b) (c) (d)

(e) (f) (g)

(h) (i) (j) (k)

(l) (m) (n)


6 Draw the graphs with the given adjacency matrix:

(a) (b) (c) (d)


7 Represent the incidence matrix for the following graphs:

(a) (b) (c)


8 Determine whether the given graphs are isomorphic or not? Justify by giving appropriate
reasons.
(a)

(b) (c)

(d) (e)
9 Does each of these lists of vertices form a path in the following graph? Which paths are simple?
Which are circuits? What are the lengths of those that are paths?
(a) 𝑎, 𝑒, 𝑏, 𝑐, 𝑏 ; ( b)𝑎, 𝑒, 𝑎, 𝑑, 𝑏, 𝑐, 𝑎; (c ) 𝑒, 𝑏, 𝑎, 𝑑, 𝑏, 𝑒 ; ( d)𝑐, 𝑏, 𝑑, 𝑎, 𝑒, 𝑐

10 Does each of these lists of vertices form a path in the following graph? Which paths are simple? Which
are circuits? What are the lengths of those that are paths?
(a )𝑎, 𝑏, 𝑒, 𝑐, 𝑏 ; (b )𝑎, 𝑑, 𝑎, 𝑑, 𝑎 ; (c )𝑎, 𝑑, 𝑏, 𝑒, 𝑎 ; (d )𝑎, 𝑏, 𝑒, 𝑐, 𝑏, 𝑑, 𝑎

11 Determine whether the given graphs are connected or not? Also find the connected
components for each of the graphs.

(a) (b) (c)


12 Determine whether each of these graphs is strongly connected or weakly connected or
unilaterally connected?

13 Determine whether each of these graphs is strongly connected or weakly connected or unilaterally
connected?

14 Determine whether the given graph has an Euler circuit or an Euler path if it exists, construct it.

15 Determine whether the given graphs have an Euler circuit or an Euler path. If it exists, construct it.Justify
your answer by giving appropriate reason.

(a) (b) (c) (d)

16 Determine whether given graphs have a Hamiltonian Circuit or a Hamiltonian path. If it exists, construct
it. Justify your answer by giving appropriate reason.
(a) (b) (c) (d)
17 Which of the given graphs are trees? Justify your Answer.

18 Answer the following questions about the rooted trees given below:

(a) Which vertex is the root?


(b) Which vertices are internal?
(c) Which vertices are leaves?
(d) Which vertices are children of 𝑗?
(e) Which vertex is the parent of ℎ?
(f) Which vertices are siblings of 𝑎?
(g) Which vertices are ancestors of m?
(h) Which vertices are descendants of b?
(i) Is the rooted tree a full m-ary tree for some positive integer m?
(j) What is the level of each vertex of the rooted tree?
(k) Draw a sub-tree of the tree in the given tree figures that is rooted at (a) a; (b) c; (c) b
19 Find a spanning tree from the following graphs:
(a) (b) (c)

20 Use Prim’s and Kruskal’s algorithm for finding the minimum spanning tree from the following
weighted graphs

(a) (b) (c)

(d) (e) (f)

You might also like