Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

On the Rainbow Vertex-Connection

Xueliang LiYongtang Shi — 2013

Discussiones Mathematicae Graph Theory

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...

Page 1

Download Results (CSV)