This preview shows page 1. Sign up to view the full content.
Unformatted text preview: , 5)graph. (6) Is there a simple graph on 6 vertices such that the vertices all have distinct degree? If not, why not? If so, draw one. (7) Let G be a kregular graph, where k is an odd number. Prove that the number of edges in G is a multiple of k . (8) Prove that it is impossible to have a group of nine people at a party such that each one knows exactly ve of the others in the group....
View Full
Document
 Spring '11
 ADEBOYE
 Graph Theory

Click to edit the document details