On a relation between Szeged and Wiener indices of bipartite graphs
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...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2012-12-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | http://www.combinatorics.ir/?_action=showPDF&article=2450&_ob=f60e633a9517e5740e317c53c0e58e76&fileName=full_text.pdf. |