On Rainbow Connection Number and Connectivity

Rainbow connection number, $rc(G)$, of a connected graph $G$ is the minimum number of colours needed to colour its edges, so that every pair of vertices is connected by at least one path in which no two edges are coloured the same. In this paper we investigate the relationship of rainbow connection number with vertex and edge connectivity. It is already known that for a connected graph with minimum degree $\delta$, the rainbow connection number is upper bounded by $3n/(\delta + 1) + 3$ [Chandran et al., 2010]. This directly gives an upper bound of $3n/(\lambda + 1) + 3$ and $3n/(\kappa + 1) + 3$ for rainbow connection number where $\lambda$ and $\kappa$, respectively, denote the edge and vertex connectivity of the graph. We show that the above bound in terms of edge connectivity is tight up-to additive constants and show that the bound in terms of vertex connectivity can be improved to $(2 + \epsilon)n/\kappa + 23/ \epsilon^2$, for any $\epsilon > 0$. We conjecture that rainbow connection number is upper bounded by $n/\kappa + O(1)$ and show that it is true for $\kappa = 2$. We also show that the conjecture is true for chordal graphs and graphs of girth at least 7.Comment: 10 page

Rainbow Connection Number and Radius

The rainbow connection number, rc(G), of a connected graph G is the minimum number of colours needed to colour its edges, so that every pair of its vertices is connected by at least one path in which no two edges are coloured the same. In this note we show that for every bridgeless graph G with radius r, rc(G) <= r(r + 2). We demonstrate that this bound is the best possible for rc(G) as a function of r, not just for bridgeless graphs, but also for graphs of any stronger connectivity. It may be noted that for a general 1-connected graph G, rc(G) can be arbitrarily larger than its radius (Star graph for instance). We further show that for every bridgeless graph G with radius r and chordality (size of a largest induced cycle) k, rc(G) <= rk. It is known that computing rc(G) is NP-Hard [Chakraborty et al., 2009]. Here, we present a (r+3)-factor approximation algorithm which runs in O(nm) time and a (d+3)-factor approximation algorithm which runs in O(dm) time to rainbow colour any connected graph G on n vertices, with m edges, diameter d and radius r.Comment: Revised preprint with an extra section on an approximation algorithm. arXiv admin note: text overlap with arXiv:1101.574