Isomorphism

This document discusses isomorphism and connectivity in graphs. It defines isomorphism and lists important results about properties that must be the same for two graphs to be isomorphic, such as the number of edges and vertices. It also discusses the contrapositive of these results. The document then defines connectivity in graphs, including connected graphs, connected components, cut vertices, and vertex connectivity.