Name: Wo: BIRLA INSTITUTE OF TECHNOLOGY & SCIENCE, PILANI HYDERABAD CAMPUS. First Semester, 2010-2011 ‘Comprehensive Examination (Part) Course Code: AAOC C221 Course Name: Graphs & Networks Date: 08.12.2010 Day: Wednesday Max Marks: 20 ‘Time: 45 Minutes Instructions: + Port. to he taken bacte aftr fiat 45 minutes, “+ There are 10 questions. Each cames ? marks for correct answer, - for wrong answer. ‘+ Any overurting/cuting will not be considered and will cary 20 mak, ‘+ Weite the alternatives A, B, C or D chosen by you in the space provided below and 0 where els, umn] i > 2] Ss 74] s ey 7 yey] s fw] am piaiplelAlcialpl|< B 1. LatGbea connected planar graph with no cu sets with I or 2 edges, then G has a region oF degree ess ost oss 2. Every planar grap G with 2 3 vere has ‘verces of degce less than 6 A)atmos3 Bates} (CJatleast2 ——_(Dpat most 2. ‘Which othe following chromatic polynomials represent ep? worn 41 at 3P 4 (Oa OA A (D)None 4, LetG bea complete graph of order n, Thon Ghat a perfact matching if and only ini (oat even (©)any number (B) none PTO.A toumanient 7 is ransiive if and only if every two vertices of T have out degrees (apDistinet @)same (©) Both (A) and (B) (D) none of (A) 0B) “The vetoes of «certain graph G have degrees 3444 5,66. Then the ara Gis (A)aot graphical (B) graphical, planer (C) graphical, nor-planar (D) none ‘The maximum number of edges of a simple graph with 49 vertices and 5 components 920 ayzas ou om Let Te tee of onder 23. Let $ and T respectively denote the numberof eut vertices and unr of bridges i G. Then wich ofthe following is us? sat @sst coset os Let G be a disconnected graph of order n having k components, where every edge of Gis abridge. Then the size of Gis. amt eset (one @)oone “The munber of spanning eso compete graph fede is (Ayl2, By 16 (20 (ops