Savitribai Phule Pune University, Pune

M.Sc. I (Mathematics) (As Per NEP2020) [2023 Pattern]

MTS- 557(A) MJP Practical based on Graph Theory
(For colleges Affiliated to Savitribai Phule Pune university, Pune)
-------------------------------------------------------------------------------------------------------------------------------
Practical No. 1
1) Let 𝐺 be a graph with 𝑛 vertices, 𝑡 of which have degree k and other have
degree 𝑘 + 1. Prove that 𝑡 = (𝑘 + 1)𝑛 − 2𝑒, where 𝑒 is the number of
edges in 𝐺.
2) Let 𝐺 be a graph with 𝑛 vertices and exactly 𝑛 − 1 edges. Prove that 𝐺 has
either a vertex of degree 1 or an isolated vertex.
3) Determine which pair of graphs are isomorphic. Justify your answer.

(a)

(b)

(c)

4) i) Find which of the graphs given in the following figure are self-
complementary.
 ii) Prove that if 𝐺 is a self-complementary graph with 𝑛 vertices then 𝑛 is
either 4𝑡 𝑜𝑟 4𝑡 + 1 for some integer 𝑡.
iii) List all the self-complementary graphs with 4 or 5 vertices.

5) Find the radius, Diameter and eccentricity of the following graphs.

6) Let 𝐺 be a Petersen graph. Find the following in graph 𝐺.

i) Trail of length 7
ii) Path of length 9
iii) Cycle of length 5 & 6

7) Let 𝐺 be a graph with 15 vertices and 4 connected components. Prove that

𝐺 has at least one component with at least 4 vertices. What is the largest
number of vertices that a component of 𝐺 can have?

************************************************************
 Practical No. -2
1) Draw the graphs having the following matrices as their adjacency matrix.

1 1 1 0 0
0 1 0 0
1 1 1 0 0
a) [1 0 2 2] b) 1 1 1 0 0
0 2 1 2
0 0 0 0 1
0 2 2 1 [0 0 0 1 0]

2) Write the adjacency matrix & the incidence matrix for the following Graphs.

3) Let 𝐺 be a graph as shown in Fig.

i) Find 𝐺 − 𝑈 where U = {𝑣1 , 𝑣2 , 𝑣3 }.

ii) Find 𝐺 − 𝐹 where 𝐹 = {𝑒1 , 𝑒3 , 𝑒4 , 𝑒6 , 𝑒10 }.
iii) Find 𝐺[𝑢] where 𝑢 = {𝑣2 , 𝑣3 , 𝑣5 , 𝑣6 }.

4) From the adjacency matrix given below, find whether the associated graph is
connected or not.
0 0 1 0 0
0 1 0 0
0 0 0 1 0
𝐴= 1 0 0 0 1 B= [1 0 1 0]
0 1 0 1
0 1 0 0 1
[0 0 0 1 0
0 1 1 0]
5) By using Fusion algorithm find the adjacency matrix of the following graph.

6) Find all non-isomorphic complete bipartite graphs with at most 7 vertices.

**************************************************************
 Practical No. -3

1) Prove that any tree with at least two vertices is a bipartite graph.
2) Draw the complete bipartite graphs 𝐾18 𝑎𝑛𝑑 𝐾33 .
3) Let 𝑇 be a tree and let 𝑣 be the vertex of maximum degree in 𝑇 , say 𝑑(𝑣) =
𝑘. Prove that 𝑇 has at least 𝑘 vertices of degree 1.
4) Find all bridges in the following graphs.

5) Let 𝐺 be a connected graph.

(i) If 𝐺 has 17 edges then what is the maximum possible number of
vertices in 𝐺?
(ii) If 𝐺 has 21 vertices then what is the minimum possible number of
edges in 𝐺.?
*************************************************************************************
 Practical No.- 4
1) How many non-isomorphic spanning trees are there in 𝐾3 and 𝐾4 ?
Give the list of all spanning trees.

2) Find the minimal spanning tree for each of the following connected
weighted graphs using Krushkal’s algorithm and prime’s algorithm.

3) Find the shortest path from source to all vertices using Dijkstra’s algorithm.

4) Find the shortest path from 𝑠 to 𝑡 using BFS algorithm.

 5) Let 𝐺 be a simple connected graph with at least two vertices and 𝑣 be a
vertex of the smallest possible degree 𝑘 in 𝐺.
(i) Prove that 𝐾(𝐺) ≤ 𝐾.
2𝑒
(ii) Prove that 𝐾(𝐺) ≤ where 𝑒 is the number of edges and 𝑛 is a
𝑛
number of vertices in 𝐺.

6) Find 𝐾(𝐺) (vertex connectivity) of the graph G.

*******************************************************************
 Practical No.5
(𝑛−1)!
1) (i) Prove that the complete graph 𝐾𝑛 has different Hamiltonian
2
cycles.
(ii) How many different Hamiltonian cycles does 𝐾𝑛𝑛 have?

2) Use Fleury’s algorithm to find a Eulerian trail in the graph given below.

3) Use Fleury’s algorithm to produce a Euler’s trails.

4) (i) Are the complete graphs 𝐾𝑛 for 𝑛 ≥ 3 Eulerian? Prove or Justify.

ii) Find the number of Hamiltonian cycles in the given graph.
5. Find the closure 𝐶(𝐺) of the following graph. Which of these are
Hamiltonian?

6. Let 𝐺 be the Hamiltonian graph & let 𝑆 be a proper subset of vertices of

𝐺. Prove that 𝑤(𝐺 − 𝑆) ≤ |𝑆|.
7. Let 𝐺 be a graph with at least 3 vertices and (𝑛−1
2
) + 2 edges. Prove that
𝐺 is Hamiltonian.
8. Let 𝐺 be a connected graph with 13 vertices & 76 edges. Show that 𝐺 is
Hamiltonian. Is 𝐺 also Eulerian? Explain.
9. For what integers 𝑚 𝑎𝑛𝑑 𝑛 is 𝐾𝑚𝑛 Hamiltonian? Explain.
10. Give an example of a graph which is
(i) Eulerian but not Hamiltonian.
(ii) Hamiltonian but not Eulerian.
(iii) Eulerian & Hamiltonian.
(iii) neither Eulerian nor Hamiltonian.

*************************************************************
 Practical No. 6
1) Solve the Chinese postman problem for the given graphs.

2) Solve the following travelling salesman problem by two optimal method

and closest insertion method.

3) Solve the following salesman problem by two optimal methods.

4) For which values of 𝑛 when 𝑛 ≥ 3 does the graph 𝐾𝑛 contains a

Hamilton path? What about a Hamilton circuit? Explain.
5) Solve the following Chinese postman problem.

***********************************************************
 Practical No 7

1) Find the number of perfect matchings of 𝐾2𝑛 .

2) Find the number of different perfect matchings in a complete bipartite
graph 𝐾𝑛𝑛 .
3) Prove that a tree has at most one perfect matching.
4) Consider the following graph 𝐺, find all the maximum matchings and
perfect matchings.

5) Amy, Beth, Cathy & Debby one is trying to decide on who to take to the
Silly Cone Valley High School Hop. The table below shows which boys they
would not mind taking. Is it possible for all 4 girls to choose suitable
partners? Answer this by first setting up a bipartite graph and checking in
details to see if Hall’s condition is satisfied by the set 𝑋 consisting of the 4
girls.

Amy Matt pete

Beth Nick
Cathy Pete, Rod, stere
Debby Rod, stere

*******************************************************************
 Practical No. 8
1) Starting with a matching consisting of a single edge, perform the
Hungarian method on bipartite graphs to determine whether or not the
graph have matching which saturate every vertex of the bipartition subset
𝑋.

2) For the graphs 𝐺 with matching 𝑀 shown by the shaded lines, find an M-
alternating path which is not M-augmenting.

3) Show that every 𝐾- cube has a perfect matching (𝐾 ≥ 2).

4) Prove that a non-empty bipartite graph 𝐺 has a perfect matching if and
only if |𝑆| ≤ |𝑁(𝑆)| for all subset 𝑆 of 𝑉(𝐺). Show by an example that the
bipartite condition cannot be omitted.
5) Which complete tripartite graphs of the form 𝐾𝑛,𝑛,𝑛 have perfect
matching?
6) Prove that a 2-regular graph 𝐺 has a perfect matching if and only if each
component of 𝐺 is an even cycle.
***********************************************************
 Practical No. 9

1) Determine the chromatic number for the following graphs and provide
a brief explanation.
(I) 𝐾𝑛 (𝐼𝐼) 𝐾𝑚𝑛 .
2) Prove that 𝑋(𝐺) = ∆(𝐺) + 1 if and only if 𝐺 is either a complete graph
or a cycle of odd length.
3) Show that if 𝐺 contains exactly one odd cycle then 𝑋(𝐺) = 3 where
𝑋(𝐺) is a chromatic number.
4) Find a coloring of the regular bipartite graph 𝐺 by using simple
sequential coloring algorithm on the list 𝑥1 , 𝑥2 … , 𝑥8 as indicated.

5) Find the coloring of 𝐺 by using smallest last sequential algorithm.

***********************************************************
 Practical No. 10

1) Using induction on 𝑛 the number vertices of 𝐺, prove that

𝑋(𝐺) + 𝑋(𝐺̅ ) ≤ 𝑛 + 1.
2) Let 𝐺 = 𝐺1 + 𝐺2 be the join of two graphs 𝐺1 & 𝐺2 . Prove that
𝑋(𝐺) = 𝑋(𝐺1 ) + 𝑋(𝐺2 )
3) Show that the following graph is a 4 critical graph.

4) Prove that if 𝐺 is k-critical then minimum degree is greater than or

equal to 𝑘 − 1. That is 𝛿(𝑣) ≥ 𝑘 − 1.
5) Prove that the Petersen graph has an edge chromatic index 4.
6) Let 𝐺 be a graph with 𝑛 vertices. If 𝑋(𝐺) = 𝑛 − 1 the what is 𝑐𝑙(𝐺)?

********************************************************
***********
 Practical No 11

1) Prove that if 𝐷 is a digraph with 𝑛 vertices 𝑣1 , 𝑣2 , … . , 𝑣𝑛 and 𝑞 arc then

𝑛 𝑛

∑ 𝑖𝑑(𝑣𝑖 ) = ∑ 𝑜𝑑(𝑣𝑖 ) = 𝑞
𝑖=1 𝑖=1

2) (i) Give an example of a 2 regular digraph with 5 vertices.

(i) Draw orientation of the graph 𝐾3 and find the strongly connected
Graph.

3) For the given graph G

(i) Find the directed walk of length 5
(ii) Find the directed trail of length 4
(ii) Find the directed path of length 3
(iii) Find the directed cycle of length 3

4. Show that the diagraph is unilaterally connected but not strongly connected.

*******************************************************************
 Practical No -12

1) Find the 𝑖𝑛(𝑣) and 𝑜𝑑(𝑣) for each vertex of the diagraph

2) Let 𝐷 be a Euler diagraph. Prove that 𝐷 is strongly connected.

3) Draw the (3,2) de Bruijn diagram and use it to construct a (3,2) de Bruijn
sequence.
4) Draw the (2,2) de Bruijn diagram and use it to construct a (2,2) de Bruijn
sequence.
5) Which diagraph of 𝑓𝑖𝑔. 𝐴 are Euler and which have a directed Euler trail?

𝑓𝑖𝑔. 𝐴

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