True: A graph is said to be Hamiltonian if it contains a cycle containing all vertices exactly once (except the first and last vertices).
Hamiltonian path: A simple path that contains every vertex of a graph exactly once.
False: Any DFS tree on the graph must have depth v-1.
For Ex. This graph. Start the DFS from any vertex you will find that depth is not v - 1.