In many cases, the vertex connectivity k$($G$)$ equals the smallest vertex degree in the graph $($the graph can be disconnected by removing all neighbors of the vertex with the smallest degree$).$ Show that this is not always true, by finding a graph G in which k$($G$)$ is different from the smallest vertex degree in G$.$