Birla Institute of Technology and Science-Pilani, Hyderabad Campus

Second Semester 2019-2020

2nd March (Monday), 2020
Midsemester Examination (Closed Book)

Course Title: Graphs & Networks Total Marks: 30

Course No: MATH F243 Time: 1.30 - 3.00 PM

Instructions
(i) Answer all questions. Marks for each question are given at the end of the question.
(ii) Write all the steps clearly and give explanations for the complete credit.
(iii) Notations and symbols have their usual meaning.

1. (a) How many (labelled) graphs exist on a given set of n vertices? How many of them
contain exactly m edges? [2M]
(b) How many (labelled) graphs with the vertex set {1, 2, ..., n} are isomorphic to Pn ?
How many are isomorphic to Cn ? (Justify your answer). [2M]

2. What is the maximum number of edges in a bipartite graph on n vertices? (Prove your
answer). [3M]

3. Show that every graph with n vertices has at least two vertices have equal degree. [2M]

4. Let G be a graph with minimum degree δ > 1. Prove that G contains a cycle of length
at least δ + 1. [3M]

5. Determine the (a) automorphism group of the graph and (b) the orbits of the graph if
exists. [3M]

6. Prove that every non trivial tree has at least 2 end vertices. [3M]

7. Draw all spanning trees of the following graph. [4M]

8. Prove that if v is cut vertex of G, then v is not a cut vertex of Ḡ. [3M]

9. If a connected graph G contains 3 blocks and k cut vertices, what are the possible
values of k. Justify your answer. [3M]

10. Let G be a 3- regular, connected graph that contains a cut vertex. Prove that κ(G) =
λ(G). [2M]

*************The End*************