T.

MARY’S COLLEGE (Autonomous)-THOOTHUKUDI

II M.SC MATHEMATICS
SEMESTER III
Core II – Graph Theory
Date : 23.08.2022 Sub Code : 21PMAC32
Time : 1 hour CIA I – August 2022 Max : 30 marks
______________________________________________________________________________
Section A (5x2=10)
Answer any FIVE questions :
2∈
1. Discuss and prove that for any simple graph G ,𝛿 ≤ ≤ ∆.
𝛾
2. Define complete bipartite graph.
3. Discuss edge induced subgraph.
4. Discuss and prove that every forest is a bipartite graph.
5. Define degree sequence and graphic.
6. Define vertex connectivity. Give one example.
7. Distinguish between trail and a path.

Section B (2x5=10)
Answer all the questions:
8. a) Show that for any graph the number of vertices of odd degree is even.
(or)
b) Explain the proof of Cayley’s theorem.
9. a) Analyze the result that every connected graph contains a spanning tree.
(or)
b) Discuss the proof of Whitney Theorem.

Section C (1x10=10)
Answer any One question:
10. Explain the characterization theorem for Bipartite graphs.
11. Evaluate that a vertex 𝑣 of a tree, 𝑣 is a cut vertex of G iff 𝑑(𝑣) > 1.
12. Analyze and discuss the proof of the following statement. A graph G with 𝛾 ≥ 3 is 2-
connected iff any two vertices of G are connected by atleast two internally disjoint paths.