Scribd
Upload
128 views3 pages

Mat206 Graph Theory, May 2024

The document is an examination paper for a B.Tech course on Graph Theory, featuring various questions divided into two parts: Part A with short answer questions and Part B with full questions from different modules. It covers topics such as regular graphs, isomorphism, Euler graphs, Hamiltonian circuits, and algorithms like Dijkstra's and Prim's. The exam has a total of 100 marks and a duration of 3 hours.

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
128 views3 pages

Mat206 Graph Theory, May 2024

The document is an examination paper for a B.Tech course on Graph Theory, featuring various questions divided into two parts: Part A with short answer questions and Part B with full questions from different modules. It covers topics such as regular graphs, isomorphism, Euler graphs, Hamiltonian circuits, and algorithms like Dijkstra's and Prim's. The exam has a total of 100 marks and a duration of 3 hours.

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/ 3

Reg No.

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


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

You might also like