Q21,paper2,J14. Consider the graph given below as :

Answer C,

For isomorphism,check.

Number of vertices

Number of edges.

Degrees of corresponding vertices

Connectedness: Each is fully connected.

Number of connected components.

Pairs of connected vertices.

Number of loops.

Number of parallel edges.

Option C has degree 3  at each vertices similar to question.