Scribd
Upload
52 views

Mat206 Graph Theory, June 2023 Different

This document outlines the examination structure for the Fourth Semester B.Tech Degree Supplementary Examination in Graph Theory at APJ Abdul Kalam Technological University. It includes details on the course code, maximum marks, duration, and a series of questions divided into Part A and Part B, covering various topics in graph theory. Each question has a specified mark allocation, with Part A consisting of short answer questions and Part B requiring detailed answers from different modules.

Uploaded by

Sam K James
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
52 views

Mat206 Graph Theory, June 2023 Different

This document outlines the examination structure for the Fourth Semester B.Tech Degree Supplementary Examination in Graph Theory at APJ Abdul Kalam Technological University. It includes details on the course code, maximum marks, duration, and a series of questions divided into Part A and Part B, covering various topics in graph theory. Each question has a specified mark allocation, with Part A consisting of short answer questions and Part B requiring detailed answers from different modules.

Uploaded by

Sam K James
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

A 02000MAT206052t03

Reg No.: Name:


APJ ABDUL KALAM TECHNOLOGICAL UNI
Fourth Semester B.Tech 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 connectivi.ty < ed.ge 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

You might also like