Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8900719 | Applied Mathematics and Computation | 2018 | 13 Pages |
Abstract
Given a connected graph G, the edge-Szeged index Sze(G) is defined as Sze(G)=âe=uvâEmu(e)mv(e), where mu(e) and mv(e) are, respectively, 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. In this paper, some extremal problems on the edge-Szeged index of unicyclic graphs are considered. All the n-vertex unicyclic graphs with a given diameter having the minimum edge-Szeged index are identified. Using a unified approach we identify the n-vertex unicyclic graphs with the minimum, second minimum, third minimum and fourth minimum edge-Szeged indices.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Guangfu Wang, Shuchao Li, Dongchao Qi, Huihui Zhang,