On the Rainbow Vertex-Connection
Discussiones Mathematicae Graph Theory, Tome 33 (2013) no. 2, p. 307.
Voir la notice de l'article dans European Digital Mathematics Library
A vertex-colored graph is rainbow vertex-connected if any two vertices are connected by a path whose internal vertices have distinct colors. The rainbow vertex-connection of a connected graph G, denoted by rvc(G), is the smallest number of colors that are needed in order to make G rainbow vertexconnected. It was proved that if G is a graph of order n with minimum degree δ, then rvc(G) < 11n/δ. In this paper, we show that rvc(G) ≤ 3n/(δ+1)+5 for [xxx] and n ≥ 290, while rvc(G) ≤ 4n/(δ + 1) + 5 for [xxx] and rvc(G) ≤ 4n/(δ + 1) + C(δ) for 6 ≤ δ ≤ 15, where [xxx]. We also prove that rvc(G) ≤ 3n/4 − 2 for δ = 3, rvc(G) ≤ 3n/5 − 8/5 for δ = 4 and rvc(G) ≤ n/2 − 2 for δ = 5. Moreover, an example constructed by Caro et al. shows that when [xxx] and δ = 3, 4, 5, our bounds are seen to be tight up to additive constants.
Classification :
05C07, 05C15, 05C40, 05C69
Mots-clés : rainbow vertex-connection, vertex coloring, minimum degree, 2-step dominating set
Mots-clés : rainbow vertex-connection, vertex coloring, minimum degree, 2-step dominating set
@article{DMGT_2013__33_2_268108, author = {Xueliang Li and Yongtang Shi}, title = {On the {Rainbow} {Vertex-Connection}}, journal = {Discussiones Mathematicae Graph Theory}, pages = {307}, publisher = {mathdoc}, volume = {33}, number = {2}, year = {2013}, zbl = {1293.05116}, language = {en}, url = {https://geodesic-test.mathdoc.fr/item/DMGT_2013__33_2_268108/} }
Xueliang Li; Yongtang Shi. On the Rainbow Vertex-Connection. Discussiones Mathematicae Graph Theory, Tome 33 (2013) no. 2, p. 307. https://geodesic-test.mathdoc.fr/item/DMGT_2013__33_2_268108/