BIRLA INSTITUTE OF TECHNOLOGY & SCIENCE, PILANI HYDERABAD CAMPUS First Semester, 2010-2011 Comprehensive Examination (Part B) Course Code: AAOC C221 ‘Course Name: Graphs & Networks Date: 08.12.2010 Day: Wednesday ‘Max Marks: 60 ‘Time: 2 Hours 15 Minutes Instructions: Tew aw fv queso, Aniwer alte quo Al gras sould be abled precy. Diferet ors ink can fe wed exept ed color, Mr fo ech queion ae ete he Endo the qvesion 1. (9) Show that a graph G ofa at most and maximum deg at ot shan (4 = 0 vers () Let T be a tree of onder 1° is graph with 8(4) & 4, then show that Tis isomorphic to some subgraph of BI 2(@) Show that if Tis a tee of order at least 3, then contains » ext vertex v such tbat ‘every vertex adjacent ov, with a most one exception, i an end verte. 1s} (©) Draw the geometrical dusl H of the following graph G. Also show that His the combinatorial un of : 15 4 @ ee . (|e Ge 4 4 & ft j a ©) Dajvethe coma polynomial ofthe towing ph. 6 Oy Ms a Ty ‘The mathematics department of the Institute plans to schedule the classes of the ‘courses Graph Theory (G), Statistics (8), Linear Algebra {L}, Calculus (C), Differential Geometry (D) and Algebra (A) this summer. Ten students indicated the ‘courses they plan ake as given in the tbl, [Sade TAT_[az TAS [Av TAS [ae [AT [AS_[AO [AiO] [Counes [1,8 [ADL ICES 1GAL/CSEALD [D.CCTDC GS Using graph theory, determine the minimum number of time periods needed to offer these courses so that every two classes having a student in common are taught at Aiferet time periods during the day. 19) PTO.4 ‘Using Dijksiza's algorithm, find the shortest path from the vertex V; 19 Vs. Determine final labels on all vertices. Also write the length ofthe shortest path from V; to Ve 2 0) ‘The edges of the network constructed below represents the supply of commodities fora the source Sto sink T. Find a maximal flow and its value. Shovr tha this vale is ‘maximum, 110)