The two graphs are NOT equal. It is enough to notice that $V_1 \ne V_2$ since $a \in V_1$ but $a \notin V_2\text{.}$ However, both of these graphs consist of three vertices with edges connecting every pair of vertices. We can draw them as follows:

$A graph with three vertices arranged as a triangle, with edges along the border of the triangle. The vertices are labeled a, b, and c.$

$A graph with three vertices arranged as a triangle, with edges along the border of the triangle. The vertices are labeled u, v, and w.$

Clearly we want to say these graphs are basically the same, so while they are not equal, they will be isomorphic. We can rename the vertices of one graph and get the second graph as the result.