%0 Journal Article
%T On a relation between Szeged and Wiener indices of bipartite graphs
%A Lilly Chen
%A Xueliang Li
%A Mengmeng Liu
%A Ivan Gutman
%J Transactions on Combinatorics
%D 2012
%I University of Isfahan
%X Hansen et. al., using the AutoGraphiX software package, conjectured that the Szeged index Sz(G) and the Wiener index W(G) of a connected bipartite graph G with n ¡Ý 4 vertices and m ¡Ý n edges, obeys the relation Sz(G)   W(G) ¡Ý 4n   8. Moreover, this bound would be the best possible. This paper offers a proof to this conjecture.
%K distance (in graph)
%K Szeged index
%K Wiener index
%U http://www.combinatorics.ir/?_action=showPDF&article=2450&_ob=f60e633a9517e5740e317c53c0e58e76&fileName=full_text.pdf.