A vertex-coloured graph G is said to be rainbow vertex-connected, if every two vertices of G are connected by a path whose internal vertices have distinct colours. The rainbow vertex-connection number of a connected graph G, denoted by rvc(G), is the smallest number of colours that are needed to make G, a rainbow vertex-connected. This study focuses on deriving formulas for the rainbow vertex connectivity number of a simple ladder graph and a roach graph.