ABSTRACT
In this chapter, the authors discuss the rainbow vertex connection number of triangular snake, double triangular snake, triple triangular snake, alternating triangular snake, double alternating triangular snake and quadrilateral snake graphs. They consider all graphs are connected, finite and undirected graphs. A graph has a set of vertices and a set of edges respectively. It refers Gross and Yellen for all kinds of definitions and notations. An edge colored graph is called rainbow connected if any two vertices are connected by a rainbow path. The rainbow vertex coloring of the triangular snake graph, double triangular snake graph, triple triangular snake graph and alternating triangular snake graph has been defined and their rainbow connection numbers have been computed using rainbow edge colorings.
