On the power graphs of finite groups and Hamilton cycle

The power graph P(G) of a finite group G is a graph whose vertex set is the group G and distinct elements x; y 2 G are adjacent if one is a power of the other, that is, x and y are adjacent if x 2 hyi or y 2 hxi. We can find groups G whose power graphs are Hamiltonian.