Improved bounds on the difference between the Szeged index and the Wiener index of graphs

DOI10.1016/j.ejc.2014.01.005zbMath1284.05082OpenAlexW2028218608MaRDI QIDQ2441954

Sandi Klavžar, Mohammad Javad Nadjafi-Arani

Publication date: 31 March 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2014.01.005

zbMATH Keywords

connected bipartite graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40)

Related Items (21)

Comparing Wiener, Szeged and revised Szeged index on cactus graphs ⋮ On the further relation between the (revised) Szeged index and the Wiener index of graphs ⋮ The vertex version of weighted Wiener number for bicyclic molecular structures ⋮ On the difference between the (revised) Szeged index and the Wiener index of cacti ⋮ On maximum Wiener index of trees and graphs with given radius ⋮ On extremal cacti with respect to the revised Szeged index ⋮ On two eccentricity-based topological indices of graphs ⋮ On the difference between the revised Szeged index and the Wiener index ⋮ Further results on the Merrifield-Simmons index ⋮ Bounds on hyper-Wiener index of graphs ⋮ Resistance distance-based graph invariants of subdivisions and triangulations of graphs ⋮ On the peripheral Wiener index of graphs ⋮ On extremal cacti with respect to the Szeged index ⋮ On the difference between the Szeged and the Wiener index ⋮ The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs ⋮ Proofs of three conjectures on the quotients of the (revised) Szeged index and the Wiener index and beyond ⋮ On eccentric distance sum and degree distance of graphs ⋮ Some degree and distance-based invariants of wreath products of graphs ⋮ Unnamed Item ⋮ Comparison between the Szeged index and the eccentric connectivity index ⋮ Relations between degree-based graph invariants

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Use of the Szeged index and the revised Szeged index for measuring network bipartivity
• On the revised Szeged index
• Note on PI and Szeged indices
• On the differences between Szeged and Wiener indices of graphs
• Average distance in weighted graphs
• On a conjecture about the Szeged index
• Extremal graphs with respect to the vertex PI index
• On distance-balanced graphs
• Finding the longest isometric cycle in a graph
• A characterization of block graphs
• The Szeged and the Wiener index of graphs
• Wiener index of hexagonal systems
• Bicyclic graphs with extremal values of PI index
• Graphs whose Szeged and Wiener numbers differ by 4 and 5
• Wiener index versus Szeged index in networks
• Wiener index in weighted graphs via unification of \(\varTheta^\ast\)-classes
• The (revised) Szeged index and the Wiener index of a nonbipartite graph
• Bicyclic graphs with maximal revised Szeged index
• Average Distance, Independence Number, and Spanning Trees
• Some new results on distance-based graph invariants
• Wiener index of trees: Theory and applications

This page was built for publication: Improved bounds on the difference between the Szeged index and the Wiener index of graphs