The b-chromatic number of powers of hypercube

A b-coloring of a graph G with k colors is a proper coloring of G using k colors in which each color class contains a vertex which has a neighbor in each of the other color classes. The largest positive integer k for which G has a b-coloring using k   colors is the b-chromatic number b(G)b(G) of G  . In this paper, we obtain bounds for the b-chromatic number of powers of QnQn, namely Qnp for all n≥5n≥5 and ⌊n2⌋