This preview shows page 1. Sign up to view the full content.
Unformatted text preview: contradiction.) Question 8. The 2dimensional torus T n is a graph with n 2 vertices, and 2 n 2 edges when n 3. (It has no edges when n = 1, and 4 edges when n = 2.) Its vertices are labeled with pairs ( x, y ), where x, y { , 1 , . . . , n1 } . Its edges are between pairs ( x, y ) and ( u, v ) such that either u x (mod n ) , v y + 1 (mod n ) or u x +1 (mod n ) , v y (mod n ). (This graph may be drawn on a donut shaped surface, called a torus , such that no edges intersect.) Describe an Euler(ian) tour in T n . Does T n have a Hamilton(ian) cycle? 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