Code No: 137CY R16

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

B. Tech IV Year I Semester Examinations, July/August - 2022
GRAPH THEORY
(Computer Science and Engineering)
Time: 3 Hours Max.Marks:75
Answer any five questions
JN
All questions carry equal marks
---

1.a) Give an example to explain the concept of eulerian digraphs and Hamilton digraphs?
TU
b) Describe the how cartesian product and composition operations are performed on graphs?
[8+7]

2.a) When do we say that two graphs are isomorphic? Give an example
H
b) Is it possible to have simple graphs with the following degree sequences? If yes, draw the
graphs
i) 2, 3, 3, 3, 3, 3, 4, 5 ii) 1, 3, 3, 4, 5, 6, 6 iii) 1, 2, 3, 3, 4, 5, 6 [6+9]
U
3.a) Explain about (i) Walk (ii) Path and (iii) Circuit with an example.
se
b) Describe the terms vertex connectivity and edge connectivity with examples. [9+6]

4. Suppose we run Dijkstra’s single source shortest-path algorithm on the following edge
d
weighted directed graph 1 with vertex P as the source. In what order do the nodes get
included into the set of vertices for which the shortest path distances are finalized?[15]
Pa
pe
rs
Graph 1
5. What is Spanning Tree and Minimum Spanning Tree (MST)? Write Kruskal’s algorithm to
find MST and apply the algorithm on the following graph 2. [15]

Graph 2
6.a) Define a tree. List and explain the properties of a tree.
b) State and explain in detail about the Cayley’s formula. [8+7]

7.a) Give an example to explain the concept of perfect matchings in graphs.

b) State and explain the concept of Konig’s theorem in detail. [8+7]

8.a) With the help of an example explain the graph coloring algorithm and its role in vertex
JN
coloring.
b) Explain the scheduling problem and equitable edge coloring problem with an example.
[8+7]
TU
---oo0oo---
H
U
se
d
Pa
pe
rs