Back to Search
Start Over
On a relation between Szeged and Wiener indices of bipartite graphs
- Source :
- Transactions on Combinatorics, Vol 1, Iss 4, Pp 43-49 (2012)
- Publication Year :
- 2012
- Publisher :
- University of Isfahan, 2012.
-
Abstract
- 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.
- Subjects :
- distance (in graph)
Szeged index
Wiener index
Mathematics
QA1-939
Subjects
Details
- Language :
- English
- ISSN :
- 22518657 and 22518665
- Volume :
- 1
- Issue :
- 4
- Database :
- Directory of Open Access Journals
- Journal :
- Transactions on Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- edsdoj.b1ca596862ff4e9f808f4ea7e6573591
- Document Type :
- article