LAUSR

Let G be a connected graph. The Szeged index of G is defined as $$Sz(G)=\sum \nolimits _{e=uv\in E(G)}n_{u}(e|G)n_{v}(e|G)$$Sz(G)=∑e=uv∈E(G)nu(e|G)nv(e|G), where $$n_{u}(e|G)$$nu(e|G) (resp., $$n_{v}(e|G)$$nv(e|G)) is the number of vertices whose distance to vertex u (resp., v) is smaller than the distance to vertex v (resp., u), and $$n_{0}(e|G)$$n0(e|G) is the number of vertices equidistant from both ends of e. Let $$\mathcal {M}(2\beta )$$M(2β) be the set of unicyclic graphs with order $$2\beta $$2β and a perfect matching. In this paper, we determine the minimum value of Szeged index and characterize the extremal graph with the minimum Szeged index among all unicyclic graphs with perfect matchings.