Let G be a connected graph. The revised edge Szeged index of G is defined
as Szeββ(G)=e=uvβE(G)ββ(muβ(eβ£G)+2m0β(eβ£G)β)(mvβ(eβ£G)+2m0β(eβ£G)β), where
muβ(eβ£G) (resp., mvβ(eβ£G)) is the number of edges whose distance to
vertex u (resp., v) is smaller than the distance to vertex v (resp.,
u), and m0β(eβ£G) is the number of edges equidistant from both ends of
e, respectively. In this paper, the graphs with minimum revised edge Szeged
index among all the unicyclic graphs with given diameter are characterized.Comment: arXiv admin note: text overlap with arXiv:1805.0657