Abstract
Let $G=(V(G),E(G))$ is a graph connected non-trivial. \textit{Rainbow connection} is edge coloring on the graph defined as $f:E(G)\rightarrow \{1,2,...,r|r \in N\}$, for every two distinct vertices in $G$ have at least one \textit{rainbow path}. The graph $G$ says \textit{rainbow connected} if every two vertices are different in $G$ associated with \textit{rainbow path}. A path $u-v$ in $G$ says \textit{rainbow path} if there are no two edges in the trajectory of the same color. The edge coloring sisi cause $G$ to be \textit{rainbow connected} called \textit{rainbow coloring}. Minimum coloring in a graph $G$ called \textit{rainbow connection number} which is denoted by $rc(G)$. If the graph $G$ has at least two \textit{disjoint rainbow path} connecting two distinct vertices in $G$. So graph $G$ is called \textit{rainbow 2-connected} which is denoted by $rc_2(G)$. The purpose of this research is to determine \textit{rainbow 2-connected} of some resulting graph operations. This research study \textit{rainbow 2-connected} on the graph (${C_4}^{K_n}$ and $Wd_{(3,2)}\square K_n$).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.