Unformatted text preview: Problem C. Read Section 9.4. Let G and H be simple graphs. Prove that G and H are isomorphic graphs if and only if ¯ G and ¯ H are isomorphic graphs. Problem D. Solve Problem 9.2. Then either prove or disprove the statement: In an Eulerian graph (i.e., a graph containing an Eulerian circuit) with an even number of vertices, the number of edges is even. Solve Problems 9.23, 9.27, 9.29, 9.38, 9.39+. 1...
View
Full Document
 Spring '07
 Peche
 Math, Combinatorics, Graph Theory, Leonhard Euler, Eulerian

Click to edit the document details