MT3001 Serial No: 1" Sessional Exam Graph Theory Total Time:1 Hour Monday, Sep 25, 2023 Total Marks: 40 Course Instructor Dr. Arfan Shahzad C.Lubion Navnuce. Section Signature Signature of Invigi > Roll No DO NOT OPEN THE QUESTION BOOK OR START UNTIL INSTRUCTED. Instructions: 1. Verify at the start of the exam that you have a total of three (03) questions printed ‘on seven (07) pages including this title page. 2. Attempt all questions on the question-book and in the given order. 3. The exam is closed books, closed notes. Please see that the area in your threshold is free of any material classified as ‘useful in the paper’ or else there may a charge of cheating. Read the questions carefully for clarity of context and understanding of meaning and make assumptions wherever required, for neither the invigilator will address your queries, nor the teacher/examiner will come to the examination hall for any assistance. Fit in all your answers in the provided space. You may use extra space on the last page if required. If you do so, clearly mark question/part number on that page to avoid confusion. 6. Use only your own stationery and calculator. If you do not have your own calculator, use manual calculations. Use only permanent ink-pens. Only the questions attempted with permanent ink- pens will be considered. Any part of paper done in lead pencil cannot be claimed for checking/rechecking. Qt | Q2 | Q3 | Total Total 2 jj | |e] Marks Obtained Vetter Signature: Vetted By: iniversity Ane Sheet Required: No LJ Yes []Mmiinis< NOME &/ National University of Computer and Emerging Sciences De bartment of Computer Science Chiniot-Faisalabad Campus S542 Sel algorithm to determine whether the degree sequence graphical or not. If possible, draw a simple graph G following S: WSs 27 Vg < 3 2>)r,Or1? on So 7 Coe 525191995 (In Non-incve ” ern ) mee d,=3 8 ee ; here chy: _ \ - WYER }01:0,0 P (im non- Wy 2 tee cde 3,0¢S> Soy ovkey) Cleosty C, is grin! So the gen ijsec. Kequence Ca au qrephicat~~aegg s a ‘ cioteaeees Ween ve See Department of Computer Science Chiniot-Faisalabad Campus b) Describe the complement of a graph and find the complement graph for the Soul <6,4,4,3,3,2,1,1>. eo ; Ga plows geoph ba ® Atooted Ry G wetea y Poy e YOy_ . Ge eee ee othing any to ves H plete Rab alegre Sey. +4 Gis £6 bo) 33,2, 11> I cs GV £153.35, 44) S5566> parte or RLGG SHU 33515 9) Is G (or <6,4,4,3,324h1>) se-complementary graph? Justify your _— A geth Gis elm Gattemguteyy if Co iS iemehic to WS O—Bemed gral Go. ) Clemy Chews Ga and G mtg cbifferent oles tee’ Sequence , Hence Cob G ad G snl wh. ~flemadeny & a kor (evittere:wvational University or Computer and Emerging Sciences Department of Computer S Dd : E fa5 | 7 And ene-te Elon) anh ECG, ) Chiniot-Faisalabad Campus 10 Points lure-preserving) or not? 3 CEeViG) 3 f= 4 er(G D EviGry) — ACY)= CEG, ) & evla) > FE)as Ev G,) Ec VGh)) => @6h)= 2 €( >) én € V(b) 3 Sno 1 € “CGr,) Owe Conve SPenlan(Q i/o AR —» 74 Loe 3 34S us cc) ke BE ee np > 7¢ Ea? De ets GF oir Dia_> 6} - Fall-2023 Paged4of7National University of Computer and ine a Department of Computer Selence ___Chintot-Fsis 5°" i ___Department of Computer Science __ vy | : ti Sa Question #3 20 Points | 2) Describe eccentricity of a vertex and center of graph. Find eccentricity of all vertices ify the center of both graphs G, and G,. Also find the radius and diameter of and sraphs E Ceenbicely | b a Ve ben ecu) = Max clev,v) VeVids) Conder fy Gh is 0 Sepp of 0 joord Induces fom ‘te vA biceS 4 Minimum ecleedtyic = 1 Sessional Fall-2023 Page 5 of 77 National University of Computer and Emerging Sciences Department of Computer Science Chiniot-Faisalabad Campus : e(ay= 2 eB)= 3 Gay 2 ye ey 2 eu) =3 ecF)=3 €(G) =2 RediaS = > Drematey = 3 | Conky fy Graph = A Subgsapy ino UCe dl yf thy vestice minis ecCeotvicly . A d G . 5 2 eccond wick A verbieS 2,3sh$0d,% e 3,3,3,3 53,45) Radi 3j & 4 Daieee 2 Conley sy 6 4 Fall-2023, Dane kat= N National University of Computer and Emerging Sciences . js __ Department of Computer Science labad a a })_ Draw a directed graph for the adjacency matrix given below oo jlo 100] Jloortl vr oot i 1 ©) Describe the conditions and sketch the product of two graphs shown below a Cau), Cav), (HH), Gye), Cov) > Chow), Cee), (5V)> on} Getibion (av) re TW. verbice) Cyoryda ) cay’) ca,u) coyhon “GA, eye adjacent Vf ») U=¥, aod ¥ edj vy ie ot v, od} U, and Ve V2 | jG Fall-2023 Page 7 of 7