Unformatted text preview: n vertices. Prove that X G ∈ Graphs n n ! aut( G ) = 2 ( n 2 ) . Hint: modify the proof that there are at most 2 ( n 2 ) n ! mutually nonisomorphic graphs on n vertices. 2. Chapter 9.2, exercises 9 and 11. 3. Chapter 11.3, exercises 20, 21, 22 and 29. 4. Chapter 11.4, exercises 2, 14, 17 and 19. 5. Chapter 11.5, exercises 1 and 3....
View
Full Document
 Spring '09
 MarniMishna
 Morphism, Isomorphism, G. Let Aut, Graphsn, mutually nonisomorphic graphs

Click to edit the document details