\input zb-basic
\input zb-ioport
\iteman{io-port 06026782}
\itemau{Li, Hengzhe; Li, Xueliang; Liu, Sujuan}
\itemti{The (strong) rainbow connection numbers of Cayley graphs on abelian groups.}
\itemso{Comput. Math. Appl. 62, No. 11, 4082-4088 (2011).}
\itemab
Summary: A path in an edge-colored graph $G$, whose adjacent edges may have the same color, is called a rainbow path if no two edges of the path are colored the same. The rainbow connection number $rc(G)$ of $G$ is the minimum integer $i$ for which there exists an $i$-edge-coloring of $G$ such that every two distinct vertices of $G$ are connected by a rainbow path. The strong rainbow connection number $src(G)$ of $G$ is the minimum integer $i$ for which there exists an $i$-edge-coloring of $G$ such that every two distinct vertices $u$ and $v$ of $G$ are connected by a rainbow path of length $d(u,v)$. In this paper, we give upper and lower bounds of the (strong) rainbow connection numbers of Cayley graphs on abelian groups. Moreover, we determine the (strong) rainbow connection numbers of some special cases.
\itemrv{~}
\itemcc{}
\itemut{edge-coloring; rainbow path; (strong) rainbow connection number; abelian group; Cayley graph; recursive circulant}
\itemli{doi:10.1016/j.camwa.2011.09.056}
\end