Name
Abstract | ||
|---|---|---|
The Szeged index of a connected graph G is defined as Sz(G)=e=uvE(G)nu(e|G)nv(e|G),where E(G) is the edge set of G, and for any e=uvE(G), nu(e|G) is the number of vertices of G lying closer to vertex u than to v, and nv(e|G) is the number of vertices of G lying closer to vertex v than to u. In this paper, we characterize the graph with minimum Szeged index among all the unicyclic graphs with given order and diameter. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.dam.2017.08.009 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Szeged index,Wiener index,Unicyclic graph,Diameter | Graph,Discrete mathematics,Combinatorics,Wiener index,Vertex (geometry),Bound graph,Connectivity,Mathematics | Journal |
Volume | Issue | ISSN |
233 | C | 0166-218X |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yan Liu | 1 | 241 | 73.08 |
| Aimei Yu | 2 | 0 | 2.37 |
| Mei Lu | 3 | 151 | 31.01 |
| Rongxia Hao | 4 | 165 | 26.11 |