Birla institute of technology & Science, Pilani

Math F 243 II Semester 2015-16 Graph & network

Mid semester Test

Date : 18/3/16 Time : 2-00-3-30 Maximum mark :35%

1 Does there exist a disconnected graph on 10 vertices , in which every vertex is of degree 4 . Justify?
[4]
2 (i) Find the minimum number of edges a simple graph on n vertices must have so we can rest assume it
is connected?
(ii) State Havel Hakimi Thm Does there exist a graph on degree sequence ( 6,5,3,3,2,2,2,2,1), if exists
draw the Graph. [5+5]
3 If G is a 4-regular graph & has at least at least 10 vertices Can we prove that G is.Hamiltonian [4]
4 Draw all non-isomorphic trees on 7 vertices whose diameter is 4 [10]
5 Let G be a graph of order n & if deg(u)+deg(v)n-1 for any two non adjacent vertices u & v of G
prove that G is connected. [8]
6 mark in answer sheet diametral path & Center(s) of graph (diametral path must be marked with zig-
zag line

7 Prove that a graph on 19 vertices and 169 edges is Hamiltonian but not Eulerian explain. [10]
8 Define eccentricity , diameter & radius For a connected graph G
hence prove rad(G) diam(G)2 rad(G) [10]

9 Test if G is hamiltonian. [10]

c
q
s

w
. v

r m
a d
u
G
' z
 10 For labeled tree on n vertices find string (prufer sequence) of length ( n-2) [4]

2
5 11
10
9
1 12
4
13
8
6

G 7

12 Prove that if a graph G has exactly 2 vertices u&v of odd degree then G has a u-v path [4]