Mathematics 1 Part I: Graph Theory

1.23 Classify by isomorphism type the graphs of Figure 1.1. Figure 1.1: 1 G 2 G 3 G 4 G 5 G 6 G 7 G 8 G 9 G 10 G 11 12 G 13 1.24 Let G = (V;E) and H = (W;B) be two graphs. Prove that G and H are isomorphic if, and only if, Gc and Hc are isomorphic. 1.25 Determine up to isomorphism the number of graphs of order 20 and size 188.

  Theory, Graph, Graph theory