Birla Institute of Technology and Science–Pilani, Hyderabad Campus

Second Semester, 2018-2019

Mid-semester Examination (Closed Book)
Course No.: MATH F243 Course Title: Graphs & Networks
Date: 13.03.2019 Time: 1.30-3.00PM
Day: Wednesday Max. Marks: 30
Notes: There are nine questions. Answer all the questions. Marks for each question are given at the end of the question.
Symbols carry the usual meaning as given in the text book. Your answer must adhere to the approach, formula contained in
the scope of the course.
Note: Throughout, unless otherwise stated, G = (V, E) is a graph of order n = |V | and size m = |E|.

Q1. (a) If S  V is a nonempty set of vertices, define what is meant by the induced subgraph S .
[1M]
(b) For which graph is it true that (justify your answer)
(i) V  G ? (ii) E  G ? [2M]
Q2. Show that a k-cube  Qk  is a k-regular bipartite graph and find the number of vertices and edges in a k-cube.
[3M]
Q3. Show that there exists a simple graph with 12 vertices and 28 edges such that the degree of each vertex is
either 3 or 5. Draw this graph. [3M]
n2
Q4. Let G be a graph of order n  2 . Prove that if deg v  for every vertex v of G, then G contains at most
3
two components. [3M]
Q5. Let G be a self-complementary graph of order n=4k, where k  1 . Let U  v : deg v  n / 2 and
W  v : deg v  n / 2 . Prove that if U  W , then G contains no vertex v such that deg v=n/2. [3M]
Q6. (a) Prove that every tree of order n has size n-1. [2M]
(b) Let di i 1 be a sequence of positive integers  1 . Using (a) prove that di i 1 is a degree sequence of a tree iff
n n

d
i 1
i  2n  2. [3M]

Q7. (a) Prove or disprove: Let G be a connected graph whose edges have distinct weights. Then G has a unique
minimum spanning tree. [1M]
(b) Show, for integer k  2 , that there exists a connected weighted graph containing exactly k unequal minimum
spanning trees. [3M]
Q8. Prove that if G is a graph of order n  3 such that deg v  n / 2 for every vertex v of G, then G is non-separable.
[3M]
Q9. (a) State Menger’s theorem. [1M]
(b) Using the statement of Menger’s theorem prove the edge-connectivity analogue of Menger’s theorem: For
distinct vertices u and v in a graph G, the minimum number of edges of G that separate u and v equals the
maximum number of pairwise edge-disjoint u-v paths in G. [2M]

************