Question: Show that each of these properties is an invariant that isomorphic simple graphs either both have or both do not have.
a) connectedness
b) the existence of a Hamilton circuit
c) the existence of an Euler circuit
d) having crossing number C
e) having n isolated vertices
f) being bipartite