AW-r761

B.Sc. Part-IlI (Semester-Vl) Eromiaation

MATHEMATICS
(Graph Thcory)
Paper-XII
limc : Three Hoursl [Maximum Marks : 60
Note :-(l) Question No. I is compulsory and attcmpt it at once only.
(2) Solve ONE question from each unit-
1. Choose the corect altemative in the following :

(i) A connected graph G is an Euler graph iff it can be decomposed into : I

(a) Walks (t) Paths
(c) Cut sets (d) Circuits
. (i0 A subgraph H: < V,, E, > ofa graph G= <Y E > is called a spanning subgraph
if: I
(a) E, =0 (b) Vr=O
(c) V, =V (d) E,=E
(iii) 'l'he concept of a tree was introduced by : t
(a) Euler (b) Hamiltonian
(c) Cayley (d) Kurato\xski
(iv) If G be a circuitless graph with n vertices and k componelts then C has : I
(a) n+ I edges (b) n- l edges
(c) n + k edges (d) n - k edges
(v) A graph can be embedded in the surface of a sphere iff it can be embedded in : I

(a) a plane (b) a circle

(c) a sphere (d) a sttaight lioe
(vi) A complete graph of five vertices is : t
(a) Planar graph (b) Non-planar graph
(c) Null graph (d) Bipadite graph
(vii) Minimum number of linearly independent vectors that sparE the vectors in a vector
space Wo is called : I

(a) Basis of vector space (b) Dimeosion of vector space

(c) Span (d) None of these
(viii) The dimension ofthe cutspace Ws is equal to thc rank ofthe graph and the oumber of
cutset vectors including 0 in W, is : I

(a) r O) 2'
(c) 3' (d) r'
YBc 15329 I (conld')
 (i*) A row *ith all zeros in incidence matrix rcpresenls : I
(a) vertex
Peodent (b) lsolated vertex
(c) Odd vertex (d) Even vertex
(x) If B is a circuit matrix (,f a connected graph G with n ve(ices and e edges then rank
ofBis: 1

(a) e+n-l (b) e-n-l

(c) e+n+l (d) e-n.f l
UNIT-I
(a) Define (i) Simple graph, (ii) Degree of a vertex. Show that tlLe maximurn number of

edges in a simple graph of n vertices is l(L-l). 2+3

2

(b) Define isomorphism between two glaphs. Prove that any two riimple connected graphs
rvith n vertices, all of Jegree two are isomorphic. 2+3

(p) From the graph giyen belorv answer the following :

v2

c.

cq

(i) Write the degree of each teltex.

(ii) Which edges are incident with the vertex V. ?

(iii) Write the adjacent vertices of Vr.

(iv) Is the graph simple ? Why ? l+l+lr2
(q) In a graph G thcre exists a path liom the venex u to lhe vertr:x v iff therc exists a walk
from u to v. 5

UNIT-II
1 (a) Prove that followiog statements are equivalent :

(i) There is exactll onc path between every pair of vertir:es in G

(ii) G is minimally connected graph. 5

(b) Define : (i) Binary tree, (ii) Rooted llee. Show that rhero are (n + l)/2 number of
pendent vertices in a binary tree *.ith n vertices. 2+3

YBC 15129 l (Contd.)

5 (p) Define eccentricity of a vertsx, Show that every tree has either one or two
centres. l+4
(q) Dehne spanning tree and find out alt possible spanning trees of the following
graph. c I+4

e5 e2

UNIT_III
6. (a) Define planar graph. If G is plaoar graph with n vertices, e edges, f faces and
k components then prove that n -e r f= k+ l. l+4
(b) Prove that every cutset in a connected graph O must contain at least onc branch of
every spanning tree of a graph G 5

7. (p) Detine fundamental ctcuits for the followirg graph Cq find rank of G, nullity of C and
lundamental circuils with refercnc€ to the spandng tre€ : T = {bt, b, b, b, b' b6).
l+4
b c
b,

c6

Grrpb G
(q) Shorv that Kuratowski's I!: graph is non-planar. 5

IJNIT_IV
8. (a) Prove that in lhe vector space of a gaph the circuit subspace and cutset subspace are
orlhogoml to each other. 5

(b) F'or a graph G with spanning tre€ T = {e, er} Iind Wo, W", Wr, Wr n Ws and
Wr u Ws. 5

el
9. (p) Prove that the set W r of all circuit yectors including zcm vcctor in Wo form a subspace
of W.. 5

vBC-15329 3 (Contd.)
 (q) Let G be a graph giver as in ligure. Find Wr, W' W1 n \\, and Wr Ws $here
subspace. ^
Wr is a circuit strbspacc and Ws is a cutset 5

"I
cr

Group G
IINIT-V
10. (a) Prove that the reduced incidence malrix of graph is non-sittgular iff the graph is a

tree. 5

(b) Define circuit matrix. find the circuit matrix of the graph. l+4

c
e l..
ll. (p) Find incidence matrix A(G), circuit matrix B(G) and sholr that ABr = 0, lbr the
follo\r,ing graph. 5

e.
\l
Grsph G
(q) Define ihe Adjacency matrix. Find the Adjacency matrlx of rhe following graph. l+4

\ c
e

YBC- I5329 525