Department of Mathematics PRACTICE SET III

UNIVERSITY OF PETROLEUM & ENERGY STUDIES, DEHRADUN

Program B.Tech (All SoCSBranches) Semester III
Course Discrete Mathematical Structures Course Code CSEG2006

1. Determine the number of vertices, the number of edges, and the degree of each vertex in the given
undirected graph. Identify all isolated and pendant vertices.

2. Determine the in-degree and out-degree of each vertex in the directed graph G as shown in the figure

3. Determine at least one example of each of the following if possible

i. Path from the vertex a to d

ii. Path from the vertex a to d including
all the edges
iii. Path from the vertex a to d including
all the vertices
iv. Simple path from the vertex a to d
v. Circuit from the vertex a including all
the vertices
vi. Cycle from the vertex a including all
the vertices
4. Draw a graph with the specified properties or give reason to show that no such graph exists.
i. A graph with four vertices of degree 3, 1, 4 and 3
Department of Mathematics PRACTICE SET III

UNIVERSITY OF PETROLEUM & ENERGY STUDIES, DEHRADUN

Program B.Tech (All SoCSBranches) Semester III
Course Discrete Mathematical Structures Course Code CSEG2006

ii. A graph with four vertices of degree 1,1, 2 and 4

iii. A simple graph with four vertices of degree 2, 2, 1 and 3
5. Draw the following graphs.
i. 3 regular but not complete
ii. 3 regular and complete
iii. 4 regular but not complete.
iv. 2 regular but not complete.
6. Determine the union and intersection of the graphs G1 and G2

7. Determine the sum of the graphs G1 and G2

8. Let G be the graph given below

i. Determine G – U; where U = {x1, x3, x5, x7}

ii. Determine G – V; where V = {e2, e5, e8, e12, e14, e1, e6, e18, e4, e19, e20}
iii. Fuse the vertex x6 and x8 and also the vertex x5 and x9.
Department of Mathematics PRACTICE SET III

UNIVERSITY OF PETROLEUM & ENERGY STUDIES, DEHRADUN

Program B.Tech (All SoCSBranches) Semester III
Course Discrete Mathematical Structures Course Code CSEG2006

9. Determine all the cut vertices and all the cut sets in the following graphs

10. Check whether the following graphs are isomorphic or not.

(i) (ii)

(iii) (iv)
11. Using Dijkstra’s algorithm, determine the length of the shortest path and hence the shortest path in
the following graphs from
(i) P to Q
Department of Mathematics PRACTICE SET III

UNIVERSITY OF PETROLEUM & ENERGY STUDIES, DEHRADUN

Program B.Tech (All SoCSBranches) Semester III
Course Discrete Mathematical Structures Course Code CSEG2006

(ii) a to z

(iii) a to z

(iv) a to z

12. Using the decomposition theorem, determine the chromatic polynomial, and hence the chromatic
number of the graph as shown below.
Department of Mathematics PRACTICE SET III

UNIVERSITY OF PETROLEUM & ENERGY STUDIES, DEHRADUN

Program B.Tech (All SoCSBranches) Semester III
Course Discrete Mathematical Structures Course Code CSEG2006

(i) (ii) (iii) (iv)

13. Use the Welch-Powell algorithm to determine the chromatic number of the following graphs

14. Which of these graphs are trees?

g) h)
Department of Mathematics PRACTICE SET III

UNIVERSITY OF PETROLEUM & ENERGY STUDIES, DEHRADUN

Program B.Tech (All SoCSBranches) Semester III
Course Discrete Mathematical Structures Course Code CSEG2006

15. Use Prim’s algorithm to find a minimum spanning tree for the given weighted graph

16. Use Kruskal’s algorithm to find a minimum spanning tree for the given weighted graph

17. Determine the maximum flow of the networks as shown below using Ford-Fulkerson algorithm.
Determine the cut with capacity equal to this maximum flow.

(i) (ii)