A graph is said to be Hamiltonian if it contains a spanning cycle. The spanning cycle is called a Hamiltonian cycle of G, and G is said to be a Hamiltonian graph. A Hamiltonian path is a path that contains all the vertices in V (G) but does not return to the vertex in which it began. The connectivity = (G) of a graph G is the minimum number of vertices whose removal results in a disconnected graph. For k, we say that G is k-connected. For = k, we say that G is strictly k-connected.