Abstract
A total-colored graph G is total rainbow connected if any two vertices are connected by a path whose edges and inner vertices have distinct colors. A graph G is total rainbow k-connected if there is a total-coloring of G with k colors such that G is total rainbow connected. The total rainbow connection number, denoted by trc(G), of a graph G is the smallest k to make G total rainbow k-connected. For n, k ≥ 1, define h(n, k) to be the minimum size of a total rainbow k-connected graph G of order n. In this paper, we prove a sharp upper bound for trc(G) in terms of the number of vertex-disjoint cycles of G. We also compute exact values and upper bounds for h(n, k).
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.
