A 02000MAT206052t03

Reg No.: Name:

APJ ABDUL KALAM TECHNOLOGICAL UNI
Fourth Semester [Link] Degree Supplementary Examination June 2023

Course Code: MAT 206

Course Name: GRAPH THEORY
M'ax. Marks: 100 Duration:3 Hours

PART A
(Answer oll questionsl each question carries 3 morks) Mark

I Prove that sum of the degrees of all vertices in G is twice the number of edges in 3

G.
Define pendant vertex, isolated vertex, and null graph with an example. 3

Define Ring Sum of G, and Gz. 3

Find the ring sum of the following graphs
rrl h

r
6l 6r

4 Define arbitrarily traceable graphs. Give an example. 3

.5 Find the maximum number of vertices possible in a 3-level binary tree. Also find J
the maximum height possible in a binary tree with I I vertices.
6 Label the vertices of the following graph with th32ir eccentricities and hence find Jr
the diameter and centre of the graph.

Page 1 of4
 02000MAT206052103

7 Show that every cut set in a connected graph must contain at least one branch of
every spanning tree of G.

a
8 Show that K5 is not planar. J

9 Define Incidence Matrix. List four properties of it. J

l0 Show that every tree with two or more vertices is 2-chromatic. J

PART B

(Answer onefall questionfrom each module, each question corries 14 marks)

Module -l
I I a) Show that a simple graph with n vertices must be connected if it has more than
(n-1Xn-2)
T edges.

b) Are the following graphs isomorphic? Justifu your answer.

12 a) A simple graph with n vertices and k components can have at most

(n- k)(n- k+ L)/2 edges.

b) Show that in any group of two or more people, there are two always with exactly
the same numbers of friends inside the group.

Module -2

n13a) Prove that a given connected graph is an Euler graph if and only if all vertices of
the graph are ofeven degree. ;
b) Prove that a connected graph is Euler if and only if it can be decomposed into
circuits.
14 a) Nine members of a new club meet each day for lunch at a round table. They decide
to sit such that every member has different neighbours at each lunch. How many

days can this arrangement last? Justiff your answer

Page2of 4
 02000MAT206052103

b) If G is a simple graph with n vertices and d.(v) > n/z for each v, then G is 7
Hamiltonian I
Module -3

15 a) Show that a Tree with n vertices has exactly n-l edges. 7

b) Prove that every tree has either one or two centres.
7
16 a) Find the shortest distance from B to G using Dijkstra,s Algorithm.
7

b) Find the minimum spanning tree using prim's algorithm.

Module -4
l7 a) A connected planar graph G with n vertices and e number of edges
has /=e-n*2regionsorfaces. _-; ,7

b) For any graph G, prove that vertex [Link] < [Link] connectivity 7
=+
l8 a) Every circuit has an even number of edges in common with any cut set.
7

b) Find a spanning tree and hence find all fundamental cut sets, associated with it.
of 7
. the following graph.

Page 3 of4
 02000MAT206052103

Module -5
19 a) lf dmu is the maximum degree of vertices in a graph, then show that

chromatic nurtber of G 3 dma, + L

'I b) Find the chromatic polynomial ofthe following graph.

20 a) If A(G) is is an incidence matrix of a connected graph G with n

vertices, then show that rank of A(G) is n-1.
rb) Check whether the graph having following adjacency matrix is connected or not.

00 r 00
000 r 0
X: r 0001
0r00r
001l0

Page 4 of4
Reg No.:

APJ AB DULKALoIfi Pl4dtfr Rtd36Tl"o-u*r*-

[Link] Dpgree 54 (R,S) / 52 (PT) (S, FE) i 54 WP) (R) Exami fe2'

tH.4
Course Code: MAT206
Course Name: GRAPH TIIEORY
Max. Marks: 100 Duration: 3 Hours

PART A
(Answer all questions; each question carries'3 morhs) Marks

l Define a regular graph. Draw a regular graph with 4 vertices which is not complete. 3

2 Define an isolated vertex and a pendant vertex with examples. 3

3 What is decomposition of a graph? Illustrate with an example. 3

4 Define a balanced digraph. When will it be regular? 3

5 What is a relation matrix? Find the relation matrix of the relation "is greater than" 3

on the set {2,5,7,9}.

6 Define distance between two vertices in a graph. What is eccentricity of a vertex 3

in a graph?
Find the number of pendant vertices in a binary tree with n vertices. 3

Define spanning tree of a connected [Link] a spanning tree of the following 3

graph.
I oE ,c
c
?'- .>- :
|
,.. ;,-/i
.__i,
a"A

What is a cut-set of a connected graph G? Define edge connectivity of a graph in 3

terms of its cut-sets.

l0 Define a k-chromatic graph. Draw a 2-chromatic graph with 3 vertices. 3

PABT B
(Answer onefull questionfrom each module, each question carries 14 marks)

Module -1
I I a) Define isomorphism of two graphs. Check whether the given graphs are 7

isomorphic or not.

Page 1 of 3
 0200MAT206L22303

b) Prove that the maximum number of edges in a simple graph with n vertices is
n(n-1)
2

12 a) If a graph has exactly two vertices of odd degree, prove that there must be a path
joining these two vertices.
b) Prove that a simple graph with n vertices and k components can have at most
.r"-gFgag edges.

Module -2
13 a) Define Euler graph and Hamiltonian circuit of a graph. Whether the given graph
has a Hamiltonian circuit? Is the graph Eulerian? Justiff your answer.

b) What is a connected graph? What are the two types of connectedness in digraphs?
Give examples.
t4 a) State and prove a necessary and sufficient condition for a given connected graph

to be Eulerian.
b) Define simple, symmetric and asymmetric digraphs and give examples for each.
Module -3
15 a) Prove that a graph G is a tree if and only if there is one and only one path between

every pair of vertices in G.

t
b) Find the shortest distance between Add C using Dijkstra's algorithm.
BoC

FJE
16 a) Prove that every tree has either one or fwo centers.

Page 2 of 3
 0200MAT206122303

b) Use Prim's algorithm to find the minimal spanning tree ofthe following graph.

Module -4
17 a) Prove that every circuit has an even number of edges in common with any cut-set. 7
b) Prove that the veftex connectivity of any graph G can never exceed the edge 7
connectivity.
l9 a) Prove that a connected planar graph with n vertices and e edges has e - n*2
regions.

b) Construct the geometric dual of given graph.

Module -5
l9 a) Define incidence matrix ofa graph. Write the incidence matrix of following graph.

b) Prove that if A(G) is the incidence matrix of a connected graph G with n vertices,

then the rank of A(G) is n - 1.

20 a) Define circuit matrix of a graph. Write the circuit matrix of following graph.

E
c
b) Prove that a covering g ofa graph is minimal if and only if g contains no paths of
length three or more.

Page 3 of 3
 {G
Reg No.:

APJ ABDUL
[Link] Degree 54 (S, FE) AS2 (PT) (S) Examination January 2024 (20

Course Code: MAT206

Course Name: GRAPH THEORY
Max. Marks: 100 Duration:3 Hours
PART A
(Answer aII qaestions; each question carrics 3 marks) Marks

'l Show that there is no simple graph corresponding to the following degree 3

sequence

2,2,3,4,5,5.
2 Draw all non-isomorphic simple graphs on 3 vertices. 3

3 Draw a connected graph which becomes disconnected when any edge is removed 3
from it.
4 What is a complement of a graph ? Illusfate with a suitable example. 3

5 Prove that there is one and only one path between any pair of vertices in a tree. 3

6 Show that the number of vertices in a binary tree is odd. 3

7 Define a planar graph. Draw two planar embeddings of Ka. 3

8 What do you mean by a fundamental circuit with respect to a spanning tree in a 3

connected graph G ? Give examples.

9 Find the chromatic number of the following graph. Justify.

v4

l0 Draw the digraph G corresponding to the adjacency mafiix

ffi3lll
tiiltl
Page 1 of4
 0200MAT206122301
I

PART B
(Answer onefall quesfionfrom each module, each question canies I1 nurks)

Module -l
I I a) Define and differentiate Mween a walk, path and circuit with examples. 7
b) Determine whether the following graphs are isomorphic. Justiff. 7

,-\
ll1

n v1

l\-/l I l-
,r
l,, -l | |

V \/
\----7i
ys
K ),, v.3

u4 vl
12 a) Prove that a graph G will be disconnected if and only if its verter< set 7 can be
partitioned into two non-empfr, disjoint subsets Vland 72 such that there exists
no edge in G whose one end vertex is in subset 7, and the other in subset V2.

b) Drawthe complete graph on n vertices Kr, for n = L,2,3,4,5,6.

Module -2
13 a) Prove that a connected graph is Euler graph if and only if it can be decomposed
into circuits.
b) Find the uniorl intersection and ring sum of the following graphs.

l'tht-

Gr G2

14 (n-1)
In a complete graph with n vertices there are edge-disjoint Hamiltonian 7
2
-a)
circuits, if n is odd number 2 3.

b) What is an equivalence graph ? Draw the equivalence graph corresponding to the

relation "is congruent to modulo 3" in the set of eleven integers from l0 to 20.

Page 2 of4
 02(ItutAT2(F122301

Module -3
15 a) Prove that a tree with n vertices have n - 1 edges. 7
b) Usb t<ruskal's algorithm to find a minimum spanning tree foi the following 7
graph

3 I 2 5

c 4f 38 3

4 2 4 3

3 3 I

t6 a) Prove that a connected graph with n vertices and n - 1 edges is a tree. 7

b) Apply Floyd Wanhall algorithm to find the shortest distance betrveen all pairs of 7
vertices in the following graph.

Module-4
l7 a) show that every cut set of a graph 6 hasrn even number of edges in common
with any circuit.
b) What are self-dual graphs ? Show that Ka is self-dual. 7
18 a) Define vertex connectivity and edge connectivity of a graph with o<amples. 7
what are separable graphs. Give examples of separable and non-separable

. graphs.

b) Draw a graph with vertex connectivity I and edge connectivity 3.

Page 3 of 4
 ffi1
.:-
lftduh-5
I9 a) For qny graph 6, slmr Olat the cilrmatie numbcr r(6) < A(G) + 1, likc A(C)
istlrcmaxinnrn degteofavertex in G.
b) hove that a coveriry g of a graph 6 b minimd if and only if g contairc m poths
of length threc or me.
20 a) Explain the ersrs ootjring, mininrd eovering md cwering nunber of a ;ryh 6
with oramples.
b) What ilo you meal by circuit mafiix of a graph ? Write down the circuit matrix
forttrc follovfug grph

"l

Pl|Ffof4
A 02000MAT206052104

Reg No.: Name:

APJ ABDUL KALAM TECHNOLOGICAL UNIV

[Link] Degree 54 (R,S) / 52 (PT) (R,S) Examination June2023 (2019

Course Code: MAT206

Course Name: GRAPH THEORY
Max. Marks: 100 Duration: 3 Hours

PART A
(Answer all questions; eoch question curries 3 marks) Marks

I Define Walk, Path and Circuit in a graph. 3

2 Define a connected graph with an example. 3

a
J Check whether the following graph is Euler. If so find an Euler tour in it. 3

$
;:;

4 Define an equivalence digraph and give an example of an equivalence digraph on

t
4 vertices.
Define center of a graph. Find the center of the following graph

v'4

6 Prove that a binary tree on n vertices has pendant vertices. J

f
7 List out any 5 different cut-sets and hence determine the edge connectivity of the 3

following graph.

Page 1 of4
 02000MAT206052104

Draw any two non planar graph with proper labelling.

Find the incidence matrix of the following graph.

l0 Define chromatic number with an example.

PART B
(Answer onefull questionfrom each module, each question carries I4 marks)

Module -1
ll a) Prove that the number of odd vertices in any graph is always even.

b) Check whether the following graphs are isomorphic or not

dl f'
EJ
ni &3

l':::1,':, .ii.i=i:iiiri- ,, : :;:,1::,t i;ll'i:r:r:::.t,iit: r,ii::+iliiiit::::..ji:-:]:::i t, .-

i:iij':.: i

l2 a) Prove that a simple graph with n vefiices and k components can have at mbst
(n-k)(n-k+1) ,

- , eoges.

b) Define a sub graph, vertex disjoint sub graph and edge disjoint sub graph with an
example.

Module -2
13 a) Prove that a connected graph G is Euler if and only if degree of allthe vertices in
G are even.
b) Distinguish between symmetric and asymmetric digraph with examples.

Page 2 of 4
 l

02000MAT206052104

l4 a) Explain travelling salesman problem.

7
b) Prove that in u .orptl"t" graph with n vertices there are edge disjoint 7
f
Hamiltonian circuits, if n is an odd number ) 3.

Module -3
15 a) Prove that a tree with n vertices has n-l edges. 7
b) Find the minimal spanning tree of the following weighted graph by using prim,s
7
Algorithm

16 a) Prove that every connected graph has at least one spanning tree.
6
b) Find the length of the shortest path from the vertex a to all other vertices
of the 8
given weighted graph G using Dijkstra's Algorithm

Module -4
l7 a) State and prove Euler theorem on plane graphs.

Page 3 of4
 't

02000MAT2060s2t04

b) Define vertex connectivity and edge connectivity of a graph with an example. 6

18 a) Prove that the maximumrvertex connectivity of a connected graph G with n 7

vertices and e edgestr

[#J.
b) Prove that every circuit has an even number of edges in common with any cut-set.

Module -5
19 a) Find the adjacency matrix corresponding to the graph given by

b) Prove that every planer graph is 5 colorable. 9

20 a) Define a circuit matrix in a graph and hence find the circuit matrix ofthe following 6

graph

b) Prove that a graph with at least one edge is 2-chromatic if and only if it has no8
circuits of odd length. I

+**

Page 4 of 4
 A 02000MAT206052t02

terSe;
RegNo.: Name:

w
APJ ABDUL KALAM TECHNOLOGICAL
Fourth Semester [Link] i"gr". Examination June2022 (2019 ,
sdryt ',i

Course Code: MAT206

- Course Name: GRAPH THEORY
Max. Marks: 100 Duration:3 Hours
PART A
(Answer all questions; each question conies 3 marks) Marks

I Prove that the maximum number of edges in a simple graph with n vertices is 3
n(zr-7)
2
'l 2 examples.
Define walk, path and circuit with 3

3 Draw a graph which is Eulerian but not Hamiltonian 3

4 Distinguish between strongly connected digraphs and weakly connected graphs 3

with examples.
5 Prove that there is one ald only one path between every pair of vertices in a tree. .3

6 Draw all unlabelled trees with 5 vertices. 3

7 Prove that the edge connectivity ofa graph cannot exceed the degree ofthe vertex 3

with the smallest degree in G.

8 Define planar graph and non-planar graph with examples.
9 Write the adjacency matrix for the following graph.

Y
vr
w
t+ -;3
l0 Prove that the chromatic polynom ial of a complete graph with 4 vertices is

7( -L)(1-2)(1-3).
PART B
(Answer onefall questionfrom each module, eoch question carries 14 mnrks)
Module -1
1l a) Prove that the number of vertices of odd degree in a graph is always even

Page 1 of4
 02000MAT206052102

b) If a connected graph G is decomposed into two subgraphs gr and L then prove

that there must be at least One vertex common between gr and gz

12 a) Determine whether the following graphs are isomorphic or not.

''a

b) If a graph has exactly two vertices of odd degree, then prove that there must be a

path joining these two vertices.

Module -2
13 a) In a complete graph with n vertices, prove that there *" +edge-disjoint
Hamiltonian circuits, if n is an odd number > 3.
b) l)For a binary relation "is greater than" on the set X: 13.4,7,5,8|
i) Draw the digraph representing the above relation
iD Write its relation matrix
2) Define equivalence digraph with an example
t4 a) Prove that a connected graph G is an Euler graph ifand only ifall vertices ofG
areof even dffee.
b) Define Hamiltonian circuit and Hamiltonian path. Give an example for each.
Also draw a graph that has a Hamiltoniao"path but not a Hamiltonian circuit.
Module -3
15 a) Prove that every tree has either one or two centers 7

b) Apply Kruskal's algorithm to find the minimal spanning tree for the following 7

weighted graph.

Page2ot 4
 02000MAT206052102

16 a) For any spanning tree of a connected graph with n vertices and e edges, prove that
there are n-l tree branches and e-n*l chords. For the following graph find two
spanning trees and hence show that an edge that is a branch ofone spanning tree
can be a chord with respect to another spanning tree of same graph.

'l
vl

rrt of uk

b) Use Dijkstra's algorithm to find the shortest path for the following weighted
digraph and find the shortest distance from veftex ato other vertices.

Modu,Ie 4
17 a) Illustnate the statement: "The ring sum of any two cut-sets in a graph is either a
-third cut-set or an edge disjoint
union of cut-sets", in the following graph.

Page 3 of4
 02meMAT206Ds2l02

t
+
b) Define edge connectivity, vertex connectivity separable and non'separable graph.
Give an example for each.
l8 a) Prove that the complete graph on 5 vertices is non-planar 7

b) Drawthe geometic dual ofthe following graph 7

Module -5
19 a) Fdrthe following graph find the 7

i. Inci&tce matrix
ii. Path mdrix betrreen vz and vs
iii. Circuit matrix

b) Draw a connectd graph ard show \at tne rank of its incidence matrix is orp less
than the number of vertices.

20 a) Prove that every tree with two or more vertices is 2-chromatic 7

b) Prove that a covering g of a graph is minimal if and only if g contains no path of 7

l€ngth thr€€ or more.

***

Page 4 of4
 Reg No.:

*t*ooI,KAtSAqq0M*jffr96gsd896
Fourth Semester [Link] Degree ExaminationJuly 2021

Course Code: MAT206

Course Name: GRAPH TIIEORY
Max. Marks: 100 Duration:3 Hours

PART A
\ (Answer all questions; each qaestion carries 3 marlcs) Marks

-:f What is the maximum number of edges in a simple graph with n vertices? 3

JustiS your answer.

There are 25 telephones in Metropolis. Is it possible to connect them with wires 3

so that each telephone is connected with exactly 7 others? Why?

Show that all vertices ofan Euler graph G are ofeven degree 3

Explain strongly connected and weakly connected graphs with the help of 3

examples.

Prove that a connected graph G with n vertices and n-l edges is a tree. 3

How many labelled trees are there with n vertices? Draw all labelled trees with 3

3 vertices.'

Define planar graphs. Is IQ, the complete graph with 4 vertices, a planar graph? 3

Justifr.
Define fundamental circuits and fundamental cut-sets.
Construct the adjacency matrix and incidence matrix of the graph .

l0 Defi ne chromatic number, What is the chromatic number of a tree with two or

more vertices?

Page 1 of 3
 02000MAT206052101

PART B
(Answer onefull qaestionfrom each module, each qaesfion carries 14 marks)
Module -l
ll a) Define complete graph and complete bipartite gaph. Draw a graph which is a
complete graph as well as a complete bipartite graph.
b) Explain walks, paths and circuits with the help of examples. 7

rz a) Define isolated vertex, pendant vertex, even vertex and odd vertex. Draw a 7
graph that contains all the above.

b) Prove that simple graph with n vertices and k components can have at most

\ (n-k)(n-k+l)12 edges.
Module -2
t3 a)

dg

Find the unioru intersection and ring sum ofthe above graphs.
b) State travelling salesman problem. How it is related to Hamiltonian circuits? 5

14 a) Prove that in a complete graph with n vertices there are (n-l)/z edge disjoint 7

Hamiltonian circuits, if n is an odd number and n 2 3 .

b) For which values of m, n is the complete graph K-,n an Euler graph ? Justi$
your answer.

Module -3
15 a) Prove that a binary tree with n vertices has (n+1)/2 pendant vertices. 7

b) Using Prims algorithm, find a minimal spanning tree for the following graph. 7

l6 a) Write down Dijkstra's algorithm and use it to find the shortest path from s to L

Page 2 of 3
 020{x}MAIt2060s2101

b) Plove that every tree has either one or two centers.

Module -4
l7 a) Define cut-set. Prove that every circuit in G has an even number
of edges in
a.
coflrmon with any cut-set.

,"t
b) Constnrct the geometric dual of the graph below

18 a) Prove that a connected planar graph with n vertices and e

edges has e-n+2
regions.
b) Let G be a connected graph and e an edge ofG. Show that e is a cut-edge
if
and only if e belon$s to every spanning tree.

Module -5
l9 a) Explainfour colour probren using the concept of chromatic number. 5
b) Let B and A be the circuit matrix and the incidence matrix of a graph G which 9
is free from loops, whose columns are arranged using the same
order of edges.
t Show that 6Br:94r:9 (mod 2).
20 a) show that chroniatic polynomial of a tree with n vertices is pr,(,tr) :
7Q'- 11n-t
b) Define path matrix of a graph. Find the path matrix p(x, y) for the graph below.

*****

Page 3 of 3