Unformatted text preview: tree can have fewer vertices of degree 1, and by drawing a tree that has this minimum number of vertices of degree 1. 3. The odd graph O n is the the graph whose vertices are the n element subsets of { 1 , 2 , . . . , 2 n +1 } ; two subsets (vertices) are adjacent in O n if they are disjoint. Prove that O n is connected. 1...
View
Full Document
 Spring '09
 M.PEI
 Math, vertices, Tutorial Centre, fewer vertices

Click to edit the document details