Rainbow Connection Number and Connectivity
Rainbow Connection Number and Connectivity
The rainbow connection number, $rc(G)$, of a connected graph $G$ is the minimum number of colors needed to color its edges, so that every pair of vertices is connected by at least one path in which no two edges are colored the same. Our main result is that $rc(G)\leq \lceil\frac{n}{2}\rceil$ …