Birla Institute of Technology and Science, Pilani, Hyderabad Campus
End Semester Examination (Closed book)
Second Semester 2021-22
MATH F421 - Combinatorial Maths
Date: 19.05.2022 Total Marks: 80 Time: 2:00 pm to 5:00 pm
Answer all the questions. Every conclusion needs to be justified properly.
(1) State True or False for each of the following statements. Give proper
justifications for each of the answers. [6 × 5 = 30]
(a) Let G be a graph of order n > 2 where n is even. Moreover, the
degree of each vertex in G is 12 (n − 2). Then G is always connected.
(b) Component of a graph is a connected subgraph that is not part of
any other larger connected subgraph. Let G be a disconnected graph of
order 10 with two components each of which is complete. Then G has
minimum 20 edges.
(c) If a tree has exactly two pendant vertices, the degree of every non-
pendant vertex is two.
(d) There are exactly 26 integers n such that 1 ≤ n ≤ 100 and n is not
divisible by 2, 3 or 5.
n!
(e) If k is a positive integer, and n = 2k, then 2k
is a positive integer.
(f ) There are exactly 5040 distinct ways to distribute 10 identical mar-
bles among 6 distinct containers.
(2) Prove or Disprove: If any 14 integers are selected from the set {1, 2, ..., 25},
there are at least two among those chosen 14 integers whose sum is exactly
26. [5]
The question paper continues on the next page.
1
2
(3) (a) Determine the number of positive integers x where x ≤ 9, 999, 999 and
the sum of the digits in x equals 31.
(b) Let dn denotes the number of derangements of n distinct objects
1, 2, ..., n. Then either prove or disprove that
n
X
n! = nCk dk .
k=0
[5 + 5 = 10]
(4) Let R be a relation on Z, the set of all integers defined by a R b if and
only if a2 = b2 . Then is R an equivalence relation? If yes, what is the
corresponding partition on Z? Answer the same in case R is defined on Z
by a R b if and only if a3 = b3 . [5]
(5) If h0 = 0, h1 = 1, h2 = 4 and h3 = 37 satisfy the recurrence relation
hn+2 + bhn+1 + chn = 0 for n ≥ 0 and constants b and c then, find a
general solution for hn if possible. [5]
(6) Let G be a simple graph with n vertices and m edges with m ≥ 3. If
m ≥ 21 (n − 1)(n − 2) + 2, then does G always contain a Hamilton cycle?
Is the converse true, i.e. if G contains a Hamilton cycle then m ≥ 21 (n −
1)(n − 2) + 2 always? Justify. [10]
(7) Determine the corner symmetry group and then find the number of non-
equivalent colorings of the corners with colors red and blue for the follow-
ing geometric objects: [10 + 5 = 15]
(a) A regular hexagon, (b) A triangle which is isoceles but not equilateral.
End of the question paper
