Roll No.
ANNA UNIVERSITY (UNIVERSITY DEPARTMENTS)
B.E. / B. Tech (Full Time) - END S E M E S T E R EXAMINATIONS, NOV/DEC 2023
INFORMATION T E C H N O L O G Y
V Semester
IT5004 - Graph Theory
(Regulation 2019)
Time: 3hrs Max. Marks: 100
CO 1 To comprehend graphs a s modeling and analysis tools.
CO 2 To introduce various data structures with graph theory.
CO 3 To learn graph theoretic algorithms.
CO 4 To understand graph coloring and covering.
COS To learn the usage and applications of graphs in social networking and media.
B L - Bloom's Taxonomy Levels
( L I - Remembering, L2 - Understanding, L 3 - Applying, L4 - Analyzing, L5 - Evaluating, L6 - Creating)
P A R T - A ( 1 0 x 2 = 20 Marks)
(Answer all Questions)
Q. No Questions Marks CO BL
1 T h e sum of degree of all vertices in a graph G is 24. Compute the 2 C01 L2
total number of edges in G .
2 Prove that the distance d(Vi, V 2) is a nletric for the following graph. 2 C01 L3
<z
>
3 Define a cut set. 2 C02 LI
4 Draw and find step-by-step the center of the given tree. 2 002 L3
5 Suppose there are 8 cities that are to be connected by means of 16 2 C03 L4
lines (roads). Show by graph how best the cities can be connected?
Also show the highest vertex and edge connectivity of the graph.
6 Write down the procedure to find whether a digraph is strongly 2 C03 L3
conhScted or weakly connected.
7 When a connected graph is unicursal? State how it is related with 2 C04 L3
Eulerl-ine.'
8 Analyze the below graph and list any four possible binary relations 2 Cp4 L4
for the digraph given below.
3
9 What are database dumps? Give its advantages and drawbacks in 2 C05 LI
social media data collection.
10 Write down the steps to be followed while using A P I s for collecting 2 COS LI
social media data.
PART- B (5 X 13 = 65 Marks)
Q. No Questions Marks CO BL
11 (a) From the graph given below draw the following:
(i) Walk of length 6 2 C01 L4
(ii) Is there an Euler graph and/or a Hamiltonian path for 8
this graph? Draw and justify your answer
(iii) Find three complete sub graphs. 3
(OR)
11 (b) (i) Prove that the number of vertices of odd degree in a graph if 4 C01 L4
always even.
(ii) Show that the maximum no of edges in a simple graph with n 4
vertices is n(n-1)/2.
(iii) A simple graph with n vertices and k components can have at 5
most ((n-k )(n-k+1))/2 edges.
12(a) (i) Write the procedure/conditions for testing whether 2 graphs are 13 C02 L3
isomorphic, 1 and 2 isomorphic. Apply the conditions on the below
graphs and check the type of isomorphism(s).
@ K / \ ( 3
Q © ® ( i )
G G'
(OR) ^^^^^^
1^
1,2 (b) (0 Write procedure for Prim's algorithm and use the algorithm to 13 C02 L3
find the minimal spanning tree starting from vertex A for the graph
given below indicating all steps with relevant sub graphs generated
in each step:
13(a) (i) By using relevant theorem and graphs illustrate the two types of 8
non-planar graphs mentioned by Polish Mathematician C04 L2
Kuratowski.
(ii) Brief about the different representations of a planar graph with 5
relevant theorems.
(OR)
13(b) (i) Derive the chromatic polynomial for determining the number of 8
ways by which a graph can be properly colored using a
sufficiently large number of colors. C04 L2
(ii) Write any five rules to be followed for vertex coloring with 5
suitable example graphs.
14(a) (i) Draw a flowchart to represent an algorithm to check for 13 C03 L5
connectedness of a given graph and to print the number of
components. Apply the procedure and analyze the graph given
below for its connectedness.
21
i
^^^^^^^^^^^^^
(OR)
14(b) (i) DrawAA/rite a flowchart to find the fundamental circuits in a given 13 COS LS
graph. Apply the procedure and analyze the graph given in
question 14 (a) (i) for the fundamental circuits present in the graph.
15(a) (i) Illustrate the various graph theoretical metrics used for detecting 13 COS L2
prominence with its definition, inferences and applications in social
networks.
(OR)
15(b) (i) Compare and contrast the various ways of visualizing social 13 COS L2
networks using graph theoretical approaches and analyze the
scenarios for which these visualizations are apt for social
networks.
P A R T - C (1 X 15 = 15 Marks)
(Q.No.16 is compulsory)
Q. No Questions Marks CO BL
16. (i) Represent the following scenarios a s graph(s):
(a) Chemical compound N2O3 2 C01
(b) Isomorphic graph equivalent to Peterson's graph. 2 C02 LS
(c) K2.3 and its chromatic number. 2 C04
(ii) (a) Given four cubes and the six faces of these cubes are 6 COS
variously colored blue, green, red or white. Apply graph L6
theory and prove is it possible to stack the cubes one on top
of another to form a column such that no color appears twice
on any of the four sides of this column?
(b) Nine members of a new club meet each day for lunch at a 3 COS
round table. They decide to sit such that every member has
different neighbors at each lunch. Show any two possible
seating arrangements as a graph (Note: Each member
represented as a vertex).
A L L THE B E S T
