Abstract
In 2010, Hansen et al. proposed three conjectures on the differences between the (revised) Szeged index and the Wiener index for a connected graph G. Recently, the above conjectures were solved by Chen et al. (2014). In this paper, as a continuance of it, we study some further relation between the (revised) Szeged index and Wiener index of connected graphs. Some sharp bounds on the difference between the (revised) Szeged index and Wiener index are established and the corresponding extremal graphs are characterized.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
