On Coloring of graph fractional powers

Moharram N. Iradmusa

\noindent Let $G$ be a simple graph. For any $k\in N$, the $k-$power of $G$ is a simple graph $G^k$ with vertex set $V(G)$ and edge set $\{xy:d_G(x,y)\le k\}$ and the $k-$subdivis…