Which is not an invariant when determining if graphs are isomorphic?

• same degree of vertices
• existence of closed loops Correct
• same number of edges
• same number of vertices