Power of graphs with (2, 2)- bipartition

We characterize the structure of graph G and the integers k for which the kth power of graph G, Gk is (2, 2) bipartite whenever the graph G is among cycle, n-cube and tree.