This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 3. Let S = { 1 , 2 , 3 , 4 , 5 } . Let G = ( V, E ) be the graph where V consists of all 2element subsets of S , and two vertices are adjacent in G if and only if the two corresponding sets are disjoint (e.g., the two vertices corresponding to { 1 , 3 } , { 2 , 5 } are adjacent, and the two vertices corresponding to { 1 , 3 } , { 3 , 5 } are not adjacent). (a) Draw the graph G and show that it is isomorphic to the Petersen graph; [2] (b) Find a trail in G that contains as many edges as possible. [2]...
View
Full
Document
This note was uploaded on 01/15/2012 for the course MATH 222 taught by Professor Huangjing during the Spring '11 term at University of Victoria.
 Spring '11
 HuangJing
 Math

Click to edit the document details