On the difference between the Szeged and the Wiener index

Marthe Bonamy, Martin Knor, Borut Lužar, Alexandre Pinlou and Riste Škrekovski

Applied Mathematics and Computation, 2017, vol. 312, issue C, 202-213

Abstract: We prove a conjecture of Nadjafi-Arani et al. on the difference between the Szeged and the Wiener index of a graph (Nadjafi-Aranifi et al., 2012). Namely, if G is a 2-connected non-complete graph on n vertices, then Sz(G)−W(G)≥2n−6. Furthermore, the equality is obtained if and only if G is the complete graph Kn−1 with an extra vertex attached to either 2 or n−2 vertices of Kn−1. We apply our method to strengthen some known results on the difference between the Szeged and the Wiener index of bipartite graphs, graphs of girth at least five, and the difference between the revised Szeged and the Wiener index. We also propose a stronger version of the aforementioned conjecture.

Keywords: Wiener index; Szeged index; Revised Szeged index; Szeged–Wiener relation (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630031730348X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:312:y:2017:i:c:p:202-213

DOI: 10.1016/j.amc.2017.05.047

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().