I am struggling to answer this question, and I was hoping for some assistance and/or help, it would be greatly appreciated.
This link is a screenshot of the question because it does include diagrams:
https://i.stack.imgur.com/wMVod.png
The question includes a definition that is used to answer the question; if anyone knows how to answer or go about this, you would be helping me out a lot.
$G_1$ is connected since you can form a path between any two vertex. In other words, you can see that the graph is formed by "one piece" (it is just a line). In the case of superconnectivity, I don't know if you understand the concept, but for the first graph, what happens if you remove a point and all edges that incide? For example, if you remove $v_6$ and the edges that incide, the graph is "separated" into "two pieces", and therefore it isn't superconnected. It is the same in the remaining graphs. Remember that this property has to be satisfied for all vertex. I hope it helped.