Tricyclic graphs with maximal revised Szeged index

The revised Szeged index of a graph GG is defined as Sz∗(G)=∑e=uv∈E(nu(e)+n0(e)/2)(nv(e)+n0(e)/2)Sz∗(G)=∑e=uv∈E(nu(e)+n0(e)/2)(nv(e)+n0(e)/2), where nu(e)nu(e) and nv(e)nv(e) are, respectively, the number of vertices of GG lying closer to vertex uu than to vertex vv and the number of vertices of GG lying closer to vertex vv than to vertex uu, and n0(e)n0(e) is the number of vertices equidistant to uu and vv. 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.