This preview shows page 1. Sign up to view the full content.
Unformatted text preview: O 2 . (b) [3 marks] Draw a graph with the same number of vertices and edges as in O 2 , and in which the degree of every vertex is 3, that is not isomorphic to O 2 . Explain why it is not isomorphic. Question 4. (a) [2 marks] Describe a path in the graph O n between the vertices { 1 , 2 , . . . , n1 , n } and { 1 , 2 , 3 , . . . , n1 , n + 1 } . (b) [3 marks] Use the idea in part (a) to show that there is a path from the vertex { 1 , 2 , . . . , n1 , n } to the vertex { 1 , 2 , 3 , . . . , n2 , n + 1 , n + 2 } in the graph O n . Question 5. [5 marks] Describe a cycle in the grid graph G n , for any even n that contains all the n 2 vertices. Prove that no cycle in G 3 contains all its vertices. 1...
View
Full
Document
This note was uploaded on 09/28/2011 for the course ECE 103 taught by Professor Nayak during the Spring '11 term at Waterloo.
 Spring '11
 Nayak

Click to edit the document details