If for every pair

*u, v* of distinct vertices,

*G* contains a revised rainbow

*u-v* geodesic, then

*G* is revised strong vertex-connected. The minimum number

*k* for which there exists a

*k*-vertex-coloring of

*G* that results in a revised strong rainbow vertex-connected graph is called the revised strong rainbow verte

*x*-connection number of

*G*, denoted by srvc

^{*}(

*G*). Then rvc

^{*}(

*C*_{n})=

for

*n*≥4 is proved, and a upper bound is given for the revised strong rainbow connection number of graphs depending on the the number of edge-disjoint triangles.