Question

for what values of n is the graph W-n Hamiltonian?

Answer 1

for the cycle to be present, dont we need atleast "3" nodes?
and as long as nodes are present, for a wheel graph, there will be atleast one way to connect them using Hamiltonian paths
so, i say \[n\ge3\]

Answer 2

thanks a lot.