A cycle graph is a graph that consists of a single cycle. It can be viewed as being formed by connecting the first and last vertices of a path graph. Therefore, it is a Hamiltonian graph.
A cycle graph is a graph that consists of a single cycle. It can be viewed as being formed by connecting the first and last vertices of a path graph. Therefore, it is a Hamiltonian graph.