Abstract In a vertex colored graph G, a rainbow path is defined as a path in which all the internal vertices get different colors. The graph G is called a strongly rainbow vertex-connected graph, if at least one shortest rainbow path exists between every pair of distinct vertices. The strong rainbow vertex-connection number, represented by srvc(G) is the fewest number of colors needed for strong rainbow vertex coloring of the graph G. This paper explores sharp upper bounds for the strong rainbow vertex-connection number of GP graphs P(n,k) for the cases when k|n and n = mk +1, m is a positive integer.