This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Name: < Math 55 Quiz 11
August 12, 2009
G81: Rob Bayer You have until 4:00 to complete this quiz. You must show your work. 1. (3 pts) Is the following directed graph strongly connected? If so, explain why. If not, ﬁnd
the strongly connected components. 2. (3 pts) Find an isomorphism between the following two graphs, or show that no isomorphism
can exist: ' 4* 0 D B Grla'kgl 6F, N9 “UV/“‘9? 04 7:?”
+0. 1 AQf/G/Qh"; Ve/‘llbefj Lh'f 61'; 6,9,7— A '- (over) “44‘; -
a 3. Consider the tree pictured below and suppose we want to make this a rooted tree by desig— nating node a?! as th root. (b) What is the height of this rooted tree? (0) Find an m such that this is a full m—ary tree, or show that no such m can exist IMO- he; Cf «ah/ﬂag“) éﬂL c )4” d What are the child(ren) and arent s of the node f ‘?
View Full Document
This note was uploaded on 08/31/2009 for the course MATH 55 taught by Professor Strain during the Summer '08 term at Berkeley.
- Summer '08