For a given graph G, S z e * (G) = ∑ e = u v ∈ E (G) m u (e) + m 0 (e) 2 m v (e) + m 0 (e) 2 is the revised edge-Szeged index of G, where m u (e) and m v (e) are the number of edges of G lying closer to vertex u than to vertex v and the number of edges of G lying closer to vertex v than to vertex u, respectively, and m 0 (e) is the number of edges equidistant to u and v. In this paper, we identify the lower bound of the revised edge-Szeged index among all tricyclic graphs and also characterize the extremal structure of graphs that attain the bound. [ABSTRACT FROM AUTHOR]