MATH1833 Midterm: MATH 1833 UNB Exam 1833 2 06
Document Summary
Partial credit will be given only if su cient progress towards an answer is shown. Spring 2018: (8 points) i was fortunate to have you this semester as a student. Now, write: my worth as a person is not determined by the grade on a test! I know more now about these topics than fourteen weeks ago. Spring 2018: (16 points) let g be a connected graph. Spring 2018: (16 points) run kruskal"s algorithm step by step to identify a minimum spanning tree for the following weighted graph: Note: the weight of an edge equals the addition of its incident vertices. Spring 2018: (20 points) consider the planar graph g below: (a) draw l(g). (b) draw g. Spring 2018 (c) draw s(g). (d) draw the dual planar graph of g. Spring 2018: (16 points) prove that r(a, b) r(a 1, b) + r(a, b 1). Spring 2018: (18 points) prove that pcn = (t 1)n + ( 1)n(t 1).
