Abstract

Let Sz⋆(G) and W(G) be the revised Szeged index and the Wiener index of a graph G. Chen et al. (2014) proved that if G is a non-bipartite connected graph of order n≥4, then Sz⋆(G)−W(G)≥(n2+4n−6)/4. Using a matrix method we prove that if G is a non-bipartite graph of order n, size m, and girth g, then Sz⋆(G)−W(G)≥n(m−3n4)+P(g), where P is a fixed cubic polynomial. Graphs that attain the equality are also described. If in addition g≥5, then Sz⋆(G)−W(G)≥n(m−3n4)+(n−g)(g−3)+P(g). These results extend the bound of Chen, Li, and Liu as soon as m≥n+1 or g≥5. The remaining cases are treated separately.

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 call

Disclaimer: 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.