Abstract
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)$$ , where $$n_{u}(e|G)$$ (resp., $$n_{v}(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)$$ is the number of vertices equidistant from both ends of e. Let $$\mathcal {M}(2\beta )$$ be the set of unicyclic graphs with order $$2\beta $$ 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
