Paper Info
Title
On the edge-Szeged index of unicyclic graphs with perfect matchings
Abstract
The edge-Szeged index of a graph G is defined as Sze(G)=∑uv∈E(G)mu(uv|G)mv(uv|G), where mu(uv|G) (resp., mv(uv|G)) is the number of edges whose distance to vertex u (resp., v) is smaller than the distance to vertex v (resp., u), respectively. In this paper, we characterize the graphs with minimum edge-Szeged index among all the unicyclic graphs with given order and perfect matchings.
Year
DOI
Venue
2020
10.1016/j.dam.2020.03.033
Discrete Applied Mathematics
Keywords
DocType
Volume
Edge-Szeged index,Szeged index,Unicyclic graph,Perfect matching
Journal
284
ISSN
Citations 
PageRank 
0166-218X
0
0.34
References 
Authors
0
3
Name
Order
Citations
PageRank
Shengjie He132.08
Rongxia Hao216526.11
Yan-quan Feng335041.80