Rainbow connection number and connected dominating sets

Chandran, Sunil L and Das, Anita and Rajendraprasad, Deepak and Varma, NithinM (2012) Rainbow connection number and connected dominating sets. In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, August 29-September 2, 2011, Budapest, hungary, pp. 206-218.

PDF elec_note_dis_math_38-1_239_2012.pdf - Published Version Restricted to Registered users only Download (192kB) | Request a copy

Abstract

The rainbow connection number of a connected graph is the minimum number of colors needed to color its edges, so that every pair of its vertices is connected by at least one path in which no two edges are colored the same. In this article we show that for every connected graph on n vertices with minimum degree delta, the rainbow connection number is upper bounded by 3n/(delta + 1) + 3. This solves an open problem from Schiermeyer (Combinatorial Algorithms, Springer, Berlin/Hiedelberg, 2009, pp. 432437), improving the previously best known bound of 20n/delta (J Graph Theory 63 (2010), 185191). This bound is tight up to additive factors by a construction mentioned in Caro et al. (Electr J Combin 15(R57) (2008), 1). As an intermediate step we obtain an upper bound of 3n/(delta + 1) - 2 on the size of a connected two-step dominating set in a connected graph of order n and minimum degree d. This bound is tight up to an additive constant of 2. This result may be of independent interest. We also show that for every connected graph G with minimum degree at least 2, the rainbow connection number, rc(G), is upper bounded by Gc(G) + 2, where Gc(G) is the connected domination number of G. Bounds of the form diameter(G)?rc(G)?diameter(G) + c, 1?c?4, for many special graph classes follow as easy corollaries from this result. This includes interval graphs, asteroidal triple-free graphs, circular arc graphs, threshold graphs, and chain graphs all with minimum degree delta at least 2 and connected. We also show that every bridge-less chordal graph G has rc(G)?3.radius(G). In most of these cases, we also demonstrate the tightness of the bounds.

Item Type:	Conference Paper
Publication:	JOURNAL OF GRAPH THEORY
Publisher:	Elsevier
Additional Information:	Copyright for this article belongs to Elsevier science
Keywords:	rainbow connectivity;rainbow coloring;connected dominating set;connected two-step dominating set;radius;minimum degree
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	27 Nov 2012 10:03
Last Modified:	28 Feb 2019 08:35
URI:	http://eprints.iisc.ac.in/id/eprint/45074

Actions (login required)

View Item