Scribd
Upload
89 views2 pages

MTL768 Tutorial

This document contains 26 questions about graph theory concepts for a tutorial sheet. The questions cover topics such as: proving properties of graphs based on order, size, and degrees of vertices; existence of cycles, paths, and cut vertices/edges in graphs; properties of regular, bipartite, and tree graphs; minimum spanning trees; and algorithms for coloring and finding paths in trees. Students are asked to prove theorems, provide counterexamples, determine values based on given properties, and design algorithms.

Uploaded by

ayan.av0010
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
89 views2 pages

MTL768 Tutorial

This document contains 26 questions about graph theory concepts for a tutorial sheet. The questions cover topics such as: proving properties of graphs based on order, size, and degrees of vertices; existence of cycles, paths, and cut vertices/edges in graphs; properties of regular, bipartite, and tree graphs; minimum spanning trees; and algorithms for coloring and finding paths in trees. Students are asked to prove theorems, provide counterexamples, determine values based on given properties, and design algorithms.

Uploaded by

ayan.av0010
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

MTL768: Graph Theory Date: January 28, 2024

Tutorial Sheet 1

II Semester 2023-24 Depertment of Mathematics, IIT Delhi

Question 1. Prove that every graph of order n ≥ 2 has at least two vertices of equal degree.

Question 2. Let p be an integer such that 0 ≤ p ≤ n. Does there exist a graph having exactly
p odd vertices?

Question 3. A graph of order 20 and size 50 has 12 vertices of degree a and remaining vertices
of degree b. Find the possible values of a and b.

Question 4. Prove that either G or its complement is connected.

Question 5. For k ≥ 2, prove that a k-regular bipartite graph has no cut edge.

Question 6. Let G be a graph with at least two vertices. Prove or disprove:

1. Deleting a vertex of degree ∆(G) cannot increase the average degree.

2. Deleting a vertex of degree δ(G) cannot reduce the average degree.

Question 7. Prove that every graph with n vertices and n edges contains a cycle
n−1
Question 8. If G has n vertices and δ(G) ≥ 2 , then prove that G is connected.

Question 9. Prove or disprove: If u and v are the only vertices of odd degree in a graph G,
then G contains a u − v path.

Question 10. Let G be a simple graph with adjacency matrix A and incidence matrix M .
Prove that the degree of vi is the ith diagonal entry in A2 and in M M T . What do the entries
in position (i, j) of A2 and M M T say about G?

Question 11. Let G be a bipartite graph with n vertices and m edges. Show that m ≤ n2 /4.

Question 12. Show that a connected graph with n vertices has at least n − 1 edges.

Question 13. Let P1 and P2 be two distinct paths from x to y in a graph G. Show that P1 ∪ P2
contains a cycle. (Prove it by construction).

Question 14. Prove that G is connected if and only if for every partition of its vertices into
two nonempty sets, there is an edge with end points in both sets.

Question 15. Let p and q be non-negative integers, not both equal to 0. Show that there is not
always a graph having p odd vertices and q even vertices. However, show that there is such a
graph if p is required to be even.

Question 16. Let T1 and T2 be two spanning trees of a connected graph G. If edge e1 is in T1
but not in T2 , prove that there exists another edge e2 in T2 but not in T1 such that (T1 − e1 ) ∪ e2
and (T2 − e2 ) ∪ e2 are also spanning trees of G.

Question 17. Prove that in a tree every vertex of degree greater than one is a cut vertex.

1
Question 18. Prove that an edge e of a connected graph G is a cut edge if and only if e belongs
to every spanning tree of G.

Question 19. Let T be a tree of order k, and let G be a graph with δ(G) = k − 1. Then prove
that T is isomorphic to some sub-graph of G.

Question 20. Prove or disprove: if d1 , d2 , . . . , dn is the degree sequence of a tree, then 1, d1 +


1, d2 , d3 , . . . , dn is the degree sequence of a tree.

Question 21. Let G be a connected weighted graph whose edges have distinct weights. Show
that G has a unique minimum spanning tree.

Question 22. Let T be a tree of order n and size m having ni vertices of degree i(i = 1, 2. . . ).
Show that n1 = n3 + 2n4 + 3n5 + 4n6 + . . . . + 2.

Question 23. Let T be an n vertex tree having one vertex of each degree i , 2 ≤ i ≤ k; the
remaining n − k + 1 vertices are degree 1 vertices. Determine n in terms of k.

Question 24. Let e be a minimum cost edge of a weighted connected graph G. Show that e
belongs to some MST of G.

Question 25. Design an algorithm for a tree T for each of the following:

1. To 2-color all the vertices of T .

2. To find a path from x to y, where x, y ∈ V (T ).

Question 26. Characterize all connected graphs with same number of vertices and edges.

You might also like