The vertex colored graph G is said rainbow vertex cennected, if for every two vertices are connected by a path whose internal vertices have distinct colors. The rainbow vertex connection number of G, denoted by rvc(G), ...