Name: ID No:

Birla Institute of Technology and Science-Pilani, Hyderabad Campus

Second Semester, 2016-2017
Comprehensive Examination (Part A)
Course Code: MATH F243 Course Name: Graphs & Networks
Date: 10.05.2017 Day: Wednesday
Max Marks: 20 Time: 2.00 P.M. – 3.30 P.M.
__________________________________________________________________________________________
Instructions: There are 10 questions. Each question carries 2 marks each. No partial marking. Any
overwriting/cutting will not be considered and will be awarded zero mark. Write your answer in the space
provided against the question and nowhere else. Symbols carry the usual meaning as in the text book and
reference book given in the course hand out.
__________________________________________________________________________________________
1. If 𝐺 is a connected graph of order 4 with degree sequence 3,2,2,1, then the number of walks of length 2
possible in 𝐺 is __________.

2. Let 𝑆 = {2,6,7}. There exists a positive integer 𝑘 such that the sequence obtained by listing each
element of 𝑆 a total of 𝑘 times, is a degree sequence of some graph, then the minimum value of 𝑘 is 4.

3. Let 𝑇 be a tree of order 𝑛 that contains vertices of degree 1 and 3 only. Then the number of vertices of
degree 1 and 3 in 𝑇 are respectively __________ and __________.

4. Let 𝐺 be a connected graph of order 6 with degree sequence 3,3,2,2,2,2. The number of spanning trees
possible in 𝐺 is __________. (Draw the graph).

5. Let 𝐺 be a connected graph of order 8 and diameter 𝑑 ≥ 3, then the maximum possible upper
Hamiltonian number is __________.

6. 𝑃𝑛 (𝜆) = 𝜆4 − 3𝜆3 + 3𝜆2 + 𝑘 be a chromatic polynomial of a connected graph 𝐺 if 𝑘 =__________.

7. Let 𝐺 be a maximal planar graph of order 𝑛 ≥ 4, size 𝑚 and maximum degree Δ(𝐺) = 𝑝. 𝐺 has 𝑛𝑖
vertices of degree 𝑖 for 3 ≤ 𝑖 ≤ 𝑝, then the value of ∑𝑝𝑖=3(6 − 𝑖)𝑛𝑖 = __________.

8. Let G be a planar graph such that no vertex of 𝐺 has degree less than 5. The number of vertices of
degree at least 5 is __________.

9. Draw an 𝐹-irregular graph whose underlying graph is 𝐾3 .

Page 1 of 2
10. Based on the mid-semester results, six students 𝐴, 𝐵, 𝐶, 𝐷, 𝐸, 𝐹 would be given one complementary text
book of Graph Theory written by seven different authors bearing number 1,2,3,4,5,6,7. There is only
one book of each author. The preference of the students is mentioned below:

𝐴; 3,5,7 𝐵: 4,6,7 𝐶: 1,4,5 𝐷: 5,6,7 𝐸: 1,2,3 𝐹: 2,3 6

Then the edge independence number is __________.

_____

Page 2 of 2