  The revised Szeged index of a graph $G$ is defined as $Sz^*(G)=\sum_{e=uv \in
E}(n_u(e)+ n_0(e)/2)(n_v(e)+ n_0(e)/2),$ where $n_u(e)$ and $n_v(e)$ are,
respectively, the number of vertices of $G$ lying closer to vertex $u$ than to
vertex $v$ and the number of vertices of $G$ lying closer to vertex $v$ than to
vertex $u$, and $n_0(e)$ is the number of vertices equidistant to $u$ and $v$.
In this paper, we give an upper bound of the revised Szeged index for a
connected tricyclic graph, and also characterize those graphs that achieve the
upper bound.
