This preview shows page 1. Sign up to view the full content.
Unformatted text preview: k + 1. Problem 3: Let G n be the graph where the vertices consist of all binary strings of length n , and two strings are adjacent if they dier in exactly two positions. Show that G n is not connected (for n 1), and not bipartite (for n 3). How many vertices and edges does G n have? 1...
View Full Document
- Spring '09