Abstract
The vertex colored graph G is said rainbow vertex cennected, if for every two vertices are connected by a path whose internal vertices have distinct colors. The rainbow vertex connection number of G, denoted by rvc(G), is the smallest number of colors that are needed in order to make G rainbow vertex connected. On this research, will be raised the issue of how to produce graphs the results of some special graph and how to find the rainbow vertex connection. Operation that use cartesian product, crown product, and shackle. Theorem in this research rainbow vertex connection number in graph the results of operations Wd3,m □ Pn,,Wd3,m ⵙ Pn, and shack(Btm,v,n).
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
