The (revised) Szeged index and the Wiener index of a nonbipartite graph

preprint2012arXivOpen access

Abstract

Hansen et. al. used the computer programm AutoGraphiX to study the differences between the Szeged index Sz(G)Sz(G) and the Wiener index W(G)W(G), and between the revised Szeged index Sz∗(G)Sz^*(G) and the Wiener index for a connected graph GG. They conjectured that for a connected nonbipartite graph GG with n≥5n \geq 5 vertices and girth g≥5,g \geq 5, Sz(G)−W(G)≥2n−5. Sz(G)-W(G) \geq 2n-5. Moreover, the bound is best possible as shown by the graph composed of a cycle on 5 vertices, C5C_5, and a tree TT on n−4n-4 vertices sharing a single vertex. They also conjectured that for a connected nonbipartite graph GG with n≥4n \geq 4 vertices, Sz∗(G)−W(G)≥n2+4n−64. Sz^*(G)-W(G) \geq \frac{n^2+4n-6}{4}. Moreover, the bound is best possible as shown by the graph composed of a cycle on 3 vertices, C3C_3, and a tree TT on n−3n-3 vertices sharing a single vertex. In this paper, we not only give confirmative proofs to these two conjectures but also characterize those graphs that achieve the two lower bounds.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.