In this paper, we show that Q n is a divisor graph, for n = 2, 3. For n ≥ 4, we show that Q n is a divisor graph iff k ≥ n− 1. For folded-hypercube, we get FQn is a divisor graph when n is odd. But, if n ≥ 4 is even integer, then FQn is not a divisor graph. For n ≥ 5, we show that (FQn) k is not a divisor graph, where 2 ≤ k ≤ ⌈ 2 ⌉ − 1.