The vertex PI index and Szeged index of bridge graphs
Discrete Applied Mathematics
Some new results on distance-based graph invariants
European Journal of Combinatorics
Use of the Szeged index and the revised Szeged index for measuring network bipartivity
Discrete Applied Mathematics
Note: Wiener index versus Szeged index in networks
Discrete Applied Mathematics
Bicyclic graphs with maximal revised Szeged index
Discrete Applied Mathematics
The (revised) Szeged index and the Wiener index of a nonbipartite graph
European Journal of Combinatorics
Improved bounds on the difference between the Szeged index and the Wiener index of graphs
European Journal of Combinatorics
| Hi-index | 0.04 |
We give bounds for the revised Szeged index, and determine the n-vertex unicyclic graphs with the smallest, the second-smallest and the third-smallest revised Szeged indices for n=5, and the n-vertex unicyclic graphs with the kth-largest revised Szeged indices for all k up to 3 for n=5, to 5 for n=6, to 6 for n=7, to 7 for n=8, and to @?n2@?+4 for n=9. We also determine the n-vertex unicyclic graphs of cycle length r, 3@?r@?n, with the smallest and the largest revised Szeged indices.