Abstract
The vertex-colored graph G = (V, E) is said rainbow vertex-connected, if for every two vertices u and v in V, there is a u − v path with all internal vertices have distinct color. The rainbow vertex connection number of G, denoted by rvc(G), is the smallest number of colors required in order to make graph G to be rainbow vertex-connected. If every two vertices u and v in V are connected by at least one shortest rainbow path, then G is strongly rainbow vertex-connected. The strong rainbow vertex- connection number, denoted by srvc(G), is the minimum number of colors required in order make graph G to be strongly rainbow vertex-connected. In this paper, we determine the rainbow vertex connection number and the strong rainbow vertex connection number of graphs which are resulted from edge comb product.
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.
