Question: 1. To what graph is Kn\v isomorphic? Explain.
2. To what graph is Cn\e isomorphic? Explain.
3. Find |Z2 ×Z3|.
4. True (prove) or false (give counterexample)?
(a) A graph with more vertices than edges is connected.
(b) A graph with fewer edges than vertices is not connected.
(c) A graph with |E(G)|
(d) Two trees with the same degree sequence are isomorphic.