Abstract
Hansen et. al. used the computer programm AutoGraphiX to study the differences between the Szeged index and the Wiener index , and between the revised Szeged index and the Wiener index for a connected graph . They conjectured that for a connected nonbipartite graph with vertices and girth Moreover, the bound is best possible as shown by the graph composed of a cycle on 5 vertices, , and a tree on vertices sharing a single vertex. They also conjectured that for a connected nonbipartite graph with vertices, Moreover, the bound is best possible as shown by the graph composed of a cycle on 3 vertices, , and a tree on 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.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.