Scribd
Upload
369 views4 pages

Mat206 Graph Theory, June 2023

The document is an examination paper for the B.Tech Degree in Graph Theory from APJ Abdul Kalam Technological University, dated June 2023. It consists of multiple parts, including questions on definitions, proofs, and examples related to graph theory concepts, with a total of 100 marks available. The exam is structured into two parts: Part A with short answer questions and Part B with full questions from various modules.

Uploaded by

Sam K James
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
369 views4 pages

Mat206 Graph Theory, June 2023

The document is an examination paper for the B.Tech Degree in Graph Theory from APJ Abdul Kalam Technological University, dated June 2023. It consists of multiple parts, including questions on definitions, proofs, and examples related to graph theory concepts, with a total of 100 marks available. The exam is structured into two parts: Part A with short answer questions and Part B with full questions from various modules.

Uploaded by

Sam K James
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

A 02000MAT206052104

Reg No.: Name:

APJ ABDUL KALAM TECHNOLOGICAL UNIV


B.Tech 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

You might also like