Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computing the bipartite edge frustration of fullerene graphs
Discrete Applied Mathematics
On a conjecture about the Szeged index
European Journal of Combinatorics
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
Towards objective measures of algorithm performance across instance space
Computers and Operations Research
Improved bounds on the difference between the Szeged index and the Wiener index of graphs
European Journal of Combinatorics
Hi-index | 0.04 |
We have revisited the Szeged index (Sz) and the revised Szeged index (Sz^*), both of which represent a generalization of the Wiener number to cyclic structures. Unexpectedly we found that the quotient of the two indices offers a novel measure for characterization of the degree of bipartivity of networks, that is, offers a measure of the departure of a network, or a graph, from bipartite networks or bipartite graphs, respectively. This is because the two indices assume the same values for bipartite graphs and different values for non-bipartite graphs. We have proposed therefore the quotient Sz/Sz^* as a measure of bipartivity. In this note we report on some properties of the revised Szeged index and the quotient Sz/Sz^* illustrated on a number of smaller graphs as models of networks.