Looking for ANU M.Sc 2007 Albera Old Question Papers? Download here the May 2007 previous years question paper for Paper I - ALGEBRA. Read the details provided below and find download link to start downloading this question paper.
Acharya Nagarjuna University (ANU) Question Papers
M.Sc. (Previous) Mathematics DEGREE EXAMINATION, MAY 2007
Paper I - ALGEBRA
Time : Three hours Maximum : 100 marks
Answer any FIVE questions. All questions carry equal marks.
Some Part of the questions are shown as text below. Complete question paper can be downloaded from the PDF file provided at the end.
"7. (a) If in a graph G there is one and only one path between every pair of vertices, show that G
is a tree.
(b) Show that a graph G with n vertices, n-1 edges and no circuits is connected. 8. (a) Show that energy circuit has an even number of edges in common with any cut-set. (b) Show that the vertex connectivity of any graph G can never exceed the edge connectivity
of G. 9. (a) Show that a connected planar graph with n vertices and e edges has e-n+2 regions. (b) In any simple, connected planar graph with f regions, n vertices and e edges (e > 2), show
that the following inequalities must hold :"
Acharya Nagarjuna University (ANU) Question Papers
M.Sc. (Previous) Mathematics DEGREE EXAMINATION, MAY 2007
Paper I - ALGEBRA
Time : Three hours Maximum : 100 marks
Answer any FIVE questions. All questions carry equal marks.
"7. (a) If in a graph G there is one and only one path between every pair of vertices, show that G
is a tree.
(b) Show that a graph G with n vertices, n-1 edges and no circuits is connected. 8. (a) Show that energy circuit has an even number of edges in common with any cut-set. (b) Show that the vertex connectivity of any graph G can never exceed the edge connectivity
of G. 9. (a) Show that a connected planar graph with n vertices and e edges has e-n+2 regions. (b) In any simple, connected planar graph with f regions, n vertices and e edges (e > 2), show
that the following inequalities must hold :"
0 comments:
Pen down your valuable important comments below