You are on page 1of 3
Reg. No. Question Paper Code : 71691 B.E. / B.Tech. DEGREE EXAMINATION, APRIL/MAY 2017 Seventh Semester ‘Computer Science and Engineering CS6702 - GRAPH THEORY AND APPLICATIONS (Regulation 2013) Time : Three hours Maximum : 100 marks Answer ALL Questions Part A (10 x 2 = 20 marks) 1. Define Euler graph, Show that an Euler graph is connected except for any isolated vertices the graph may have. Can there be a path longer than a Hamiltonian path (if any) in a simple, connected, undirected graph? Why? Define planar graphs. Identify two spanning trees for the following graph: A 1 B 2 Cc 3. 4. 5. Does the following graph have 1 a b 2 e 3 d e 6. Draw Ks and Ky and show that thickness of Ks is 2 while thickness of Ky is 3. State the rule of sum, the first principle of counting. 8. Use Venn diagram to represent the following scenario : 1S: se, Ci= contin 1 an C= comltion 2 tafe by wome element ofS indole oo the agram - 8, NC, NC9, NC. Co)apd NC.) 9. Give explain for te folowing :Geoeating fon fr the noo ways wo have w ‘ea in pennies nickels = (Fat bos (La at oe) 10 Sole te ecunence eon yop — &y = MEM TE Diy Part 8-5 16 = 80 marks) 1G) Deine the Felling ere Walk ih) Euleepath il), nisin yd tiv) Sahgraph 7) Che i) Complete gaps Oy From the given raph daw the following (vk) Walk enctn 6 {Ins ler graph Give rene {hx here Harman path or his graph? Give reasons 18) Find aleat wo complete subgraphs ao or 0) i) Listany ive properties oF tees o (i) Define goemichy af venex Via aes T and give un example tee and it ‘cet from he roa ‘a 12, @) (Define panning uee and give sn example i) farm has six walled pts fof wast. The raph eEsewaton of it 6 fuser below. Use Die comets of panning tee curse apioiaaly enrine te falling {0} How many wll wi fave foe broken so that al he we cane ‘alse ou? (2) only ne plot was fil of water ad this ta Yo he dined int saper os. tho hw many walls net be Boke” 42 _ } N. o (©) Soe the Eer's forma rating the mamberof veces ages and faces of planar ‘connect graph Give to condoms for tsing fer papa of given graph. Give {Nanple gp st antral se ese anne 13. a) Doses he steps to in adjaconcy mate and inidenes mati fora arsed gap lia snp extmp or (0) Wei s note on chranate polyno and Use applications 14. a) tn or many’ ways cn the 2 eters ofthe alphabet be permuted so tha he pastes cat dog. pu erbytoweute? Use ie aise ofinluton ad eels fos. or (0) When halle ushered 1,23. ate hen is succes fe 2 contains 2 renconre cnr if al withdrawn ruanered am, I <= m <=, Fad he prosaiit of sting branes {iy exam rencontre Wit) “Aucast ono enconseand 9) rencantin] <= 7 <= 1 Show inermelate steps, 15. a) a, is cont of mame of ways sequeee of sand 25 Wl sum w a for >= 8. Fea=3 1b (Gd, and (i) 2, Taam 03 Fhdand soe asequece relation foray (b) What are Fears digrams? Desrive bow thy ate usd to @) represen integer Puition (i) Conjuyate dagam cf dus poriomms (i) sellcorjupas Ge) Femcscming bsechrms of potion

You might also like