The rainbow connection number of enhanced power graph

Let $G$ be a finite group, the enhanced power graph of $G$, denoted by ${\mathrm{\Gamma }}_G^e$, is the graph with vertex set $G$ and two vertices $x,y$ are edge connected in ${\mathrm{\Gamma }}_G^e$ if there exist $z\in G$ such that $x,y\in\langle z\rangle$\mathrm{.}Let$\zeta$beaedge-coloringof$\Gamma_G^e$. In this article, we calculate the rainbow connection number of the enhanced power graph ${\mathrm{\Gamma }}_G^e$.