Variable neighborhood search for extremal graphs: 1 the AutoGraphiX system
Discrete 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
Note: Further results on hierarchical product of graphs
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.00 |
Khalifeh, Yousefi-Azari, Ashrafi and Wagner [M.K. Khalifeh, H. Yousefi-Azari, A.R. Ashrafi, S.G. Wagner, Some new results on distance-based graph invariants, European J. Combin. 30 (2009) 1149-1163] conjectured that for a connected graph G on n vertices and m edges with Szeged index Sz, Sz=mn^2/4 if and only if G is a regular bipartite graph. In this note, we disprove this conjecture and then prove a stronger result from which it follows that the equality holds if and only if G is a transmission-regular bipartite graph.