Abstract
A path in an edge coloured graph with no two edges sharing the same colour is called a rainbow path. The rainbow connection number $rc(G)$ of $G$ is the minimum integer $k$ for which there exists an $k-$ edge-coloring of $G$ such that every two distinct vertices of $G$ are connected by a rainbow path. It is known that computing the rainbow connection number of a graph is $NP-$Hard. So, it is interesting to compute $rc(G)$ for any given graph $G$. In this paper, we compute the rainbow connection number for oxide networks.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Mathematics and Soft Computing
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.
