Unformatted text preview: n 1’s and n 0’s, where 2 vertices (strings) are adjacent if and only if they diﬀer in exactly two positions. (a) Draw graphs A 2 and A 4 . (b) Determine the number of vertices and edges in A 2 n . (c) Is A 2 n connected? Justify your claim. 5. (a) Let G be a graph with p vertices. Show that if every vertex has degree at least b p 2 c , then G is connected. (b) Can this result be strengthened; that is, does it still hold if every vertex has degree at least b p 2 c -1? 1...
View Full Document
- Spring '09
- Math, Recurrence relation, initial conditions, homogeneous recurrence relation, linear recurrence relation, Tutorial Centre, 8 3 G