In a vertex colored graphG, a rainbow path is defined as a path in which all the internal vertices get different colors. The graphGis 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 bysrvc(G) is the fewest number of colors needed for strong rainbow vertex coloring of the graphG. This paper explores sharp upper bounds for the strong rainbow vertex-connection number of GP graphsP(n,k) for the cases whenk|nandn=mk+1,mis a positive integer.
展开▼
