Name
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. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.amc.2018.04.077 | Applied Mathematics and Computation |
Keywords | Field | DocType |
05C12,05C90 | Graph,Combinatorics,Wiener index,Vertex (geometry),Mathematical analysis,Connectivity,Mathematics | Journal |
Volume | ISSN | Citations |
336 | 0096-3003 | 0 |
PageRank | References | Authors |
0.34 | 15 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guangfu Wang | 1 | 1 | 2.05 |
| Shuchao Li | 2 | 183 | 35.15 |
| Dongchao Qi | 3 | 0 | 0.34 |
| huihui zhang | 4 | 30 | 7.61 |