Scribd
Upload
98 views

TUTORIAL 5 (A) : Graphs and Trees 1: Q W C K K K

This document provides a tutorial on graphs and trees in discrete mathematics. It includes 20 exercises on topics such as defining different types of graphs like simple graphs, pseudo-graphs, paths, and circuits. It asks students to identify properties of graphs like isolated vertices, connected components, Euler and Hamiltonian paths/circuits. Students are asked to represent graphs using adjacency and incidence matrices. They must also determine if graphs are isomorphic, bipartite, planar or have cut vertices. Exercises involve drawing graphs, finding graph properties, and applying graph concepts and theorems.

Uploaded by

Tailor Mohit
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
98 views

TUTORIAL 5 (A) : Graphs and Trees 1: Q W C K K K

This document provides a tutorial on graphs and trees in discrete mathematics. It includes 20 exercises on topics such as defining different types of graphs like simple graphs, pseudo-graphs, paths, and circuits. It asks students to identify properties of graphs like isolated vertices, connected components, Euler and Hamiltonian paths/circuits. Students are asked to represent graphs using adjacency and incidence matrices. They must also determine if graphs are isomorphic, bipartite, planar or have cut vertices. Exercises involve drawing graphs, finding graph properties, and applying graph concepts and theorems.

Uploaded by

Tailor Mohit
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

PARUL UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY


Department of Applied Science & Humanities
3rd Semester B. Tech (CSE, IT)
Discrete Mathematics (203191202)

TUTORIAL 5(a): Graphs and Trees

1 State the difference between the following:


(a) Simple graph and Pseudo-graph
(b) Isolated vertex and Pendant vertex
(c) Path and Circuit
(d) Euler Path and Hamiltonian Path
(e) Euler Circuit and Hamiltonian Circuit
(f) Strongly connected graph and Weakly connected graph
2 State and prove Handshaking Theorem.
3 Find the number of vertices, number of edges, and degree of each vertex in the following
Undirected graphs. Identify all isolated and pendant vertices. Verify Handshaking Theorem.

4 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.

5 Draw the graphs: K 7 , K1,8 , K 4,4 , C7 ,W7 , Q4


6 Check whether the following graphs are bipartite or not
7 Represent the following graphs using adjacent and incidence matrices:

8 Draw the undirected graphs with the given adjacency matrix:

9 Draw the directed graphs with the given adjacency matrix:

10 Determine whether the given graphs are isomorphic or not? Justify by giving appropriate
reasons.

(a)
(b)

(c)

(d)

(e) (f)

(g)
11 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)𝑎,𝑒,𝑎,𝑑,𝑏,𝑐,𝑎 (a )𝑎,𝑏,𝑒,𝑐,𝑏 (b )𝑎,𝑑,𝑎,𝑑,𝑎
(c) 𝑒,𝑏,𝑎,𝑑,𝑏,𝑒 (d)𝑐,𝑏,𝑑,𝑎,𝑒,𝑐 (c )𝑎,𝑑,𝑏,𝑒,𝑎 (d )𝑎,𝑏,𝑒,𝑐,𝑏,𝑑,𝑎

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

(a) (b) (c)


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.

(7) (8)
15 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)
16 Find the length of a shortest path between a and z in the following weighted graphs:
(a) (b)
17 In Exercises find the chromatic number of the given graph.

18 In Exercises draw the given planar graph without any crossings.

19 Use paths either to show that these graphs are not isomorphic or to find an isomorphism
between them.

20 Find all the cut vertices of the given graph.

Math the Following:

Types of Graph Graphs


K4
2-regular

C5

W4

2-cube

K2,2

Bipartite

You might also like