Semester : SEMESTER 4
Subject : GRAPH THEORY
Year : 2021
Term : JULY
Branch : COMPUTER AND DESIGN
Scheme : 2019 Full Time
Course Code : MAT 206
Page:1
Reg No: 20005 0465 Name:
APJ ABDUL ۱ 0 १1 11111 UNIVERSITY
Fourth Semuster B.Tech Dexese Examination July 2021 (2019 Scheme}
Course Cudé: MAT206
Course GRAPH THEORV
Max, Marks: 100 2111000 JHours
PART ௩
{Answer sit questions; each gucstion ೦೫೫7103 3 morks} Marks
| ۷۷۲۶۱ is the maximum number of edges in a simple graph with ಗ venices} 3
Justify your unawer
2 There are 25 iclephones in Metropolis. Is ut possible 10 connect them with wires 3
$ thal each telephone is cannecled wilh exactly 7 others? Why?
3 Show chai 81117671083 ofan Euler graph © are 01 even degree 3
4 Explain strongly connected and weakly ഡി prapbs wid) the help of 3
exumples.
5 Prove that ६४ connected ൨ G wilb ೧ vertices and ೧-| edges 15 8 mee. 3
3 How many Jabelled wees are there with n veriicas? Drnw al! labelled wees vith 3
3 vertices,
7 Define planur ബ്രാ. 15 Ky, the complete റ്റാ with 4 vertices, ५ planar graph? 3
Justify,
Define fundamental circuits and Fuodamensal ௦௭1, 3
9 Construct the adjacency matrix and incideace matix of the graph ۔ 3
10 Define chromatic number, "शा is 2൦ chromatic 1101001 ೦1 8 ۱۳۰۰ wilh ovo 3