The 3-rainbow index and connected dominating sets

A tree in an edge-colored graph is said to be rainbow if no two edges on the tree share the same color. An edge-coloring of $$G$$G is called a 3-rainbow coloring if for any three vertices in $$G$$G...