INDIAN INSTITUTE OF MANAGEMENT INDORE

Integrated Programme in Management

Term: III Batch: IPM 2024-29

Subject: Discrete Mathematics and Graphs

Exercises

Q.1. G is a simple, undirected graph with set of vertices 𝑉 = {𝑎, 𝑏, 𝑐, 𝑑, 𝑒, 𝑓} . The

following matrix, A, is the adjacency matrix of G.

𝑎 𝑏 𝑐 𝑑 𝑒 𝑓
𝑎 0 1 1 0 0 0
𝑏 1 0 1 1 0 0
𝑐 1 1 0 1 1 0
𝐴= 𝑑
0 1 1 0 1 1
𝑒 0 0 1 1 0 1
𝑓 [0 0 0 1 1 0]

(a) Write down the incidence matrix of G.

(b) Is G connected? Justify.

(c) How many edges does the complement of G have? Write down all steps
in your computation. Is the complement of G connected? Justify.

(d) Does G have an Euler path? If not, why not? If so, find an Euler path.

(e) Does G have an Euler cycle? If not, why not? If so, find an Euler cycle.

Q.2. Does there exist a simple, undirected graph with degree sequence
(7, 7, 7, 6, 6, 6, 4, 2)? Give two different reasons to justify your answer.

Q.3. Two simple, undirected graphs, G1 and G2, have the same degree sequence. Is
it necessary for G1 and G2 to be isomorphic? Prove/ disprove.

Q.4. A simple graph, G, has 11 vertices.

• What is the maximum number of edges G can have?

• Suppose G has 33 edges. Can G be bipartite? Justify.

Page 1 of 5
Q.5. Consider the following graph.

4 5

3 6

2
7

1 8

Is the graph bipartite? Justify.

Q.6. Suppose G is a simple, undirected graph with n vertices. And suppose  and 
are the minimum and maximum degree of vertices in G.

• If  +  ≥ n − 1, prove that G is connected.

• If  +  < n − 1, is it necessary that G has 2 or more components?

Prove/ disprove.

Q.7. Find the edge chromatic number and the (vertex) chromatic number for each
of the following graphs:

• 𝐾4

• 𝐾5

• 𝐾4,3

For each part, provide a minimal proper (edge/ vertex) colouring and prove/
reason out that the colouring is minimal.

Page 2 of 5
Q.8. An Association of Industries wants to form a committee with at least
• one female,
• one male,
• one transgender,
• one employee from the private sector,
• one employee from the public sector,
• one academician.

Following are the nominations.

Nominations Details of Individual

P1 Female, Private sector

P2 Male, Private sector

P3 Male, Academician

P4 Transgender, Public sector

P5 Female, Academician

P6 Female, Academician

P7 Transgender, Academician

P8 Female, Public sector

P9 Male, Academician

P10 Male, Private sector

P11 Male, Public sector

P12 Female, Private sector

Represent the above as a graph and use the same to find a committee.

Page 3 of 5
Q.9. Prove that in any set of 6 people, there are always either (at least) 3 mutual
friends or (at least) 3 mutual strangers.

Q.10. Suppose G is the following graph.

• Find the edge chromatic number and the (vertex) chromatic number
of G. Provide a minimal proper edge colouring and a minimal proper
vertex colouring, and prove/ reason out that the colourings you have
provided are minimal.

• If you remove one vertex (and the incident edges) from G, show that
the resulting graph is planar. Draw a plane diagram of such as graph
(G – any one vertex), label all its regions and find the regional degree
of each region.

• What is the minimum number of vertices that must be removed from

G so as to get a disconnected graph (with two or more components)?
Prove/ disprove.

• Is G planar? Prove/ disprove.

Page 4 of 5
Q.11. Suppose G1 is the following graph.

Is G1 planar? Why/ why not?

Q.12. Show that 𝐾4,2 is planar. Draw a plane diagram of 𝐾4,2 , label each region and
find the regional degrees of each region.

Q.13. In the following graph, find a shortest path from u to v and find a minimal
spanning tree rooted at u. Write all steps.

Page 5 of 5