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

DOI10.1016/j.ejc.2013.07.019zbMath1284.05079arXiv1211.5457OpenAlexW1991095566MaRDI QIDQ2441630

Lily Chen, Meng-Meng Liu, Xue Liang Li

Publication date: 25 March 2014

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

Full work available at URL: https://arxiv.org/abs/1211.5457

zbMATH Keywords

connected nonbipartite graph

Mathematics Subject Classification ID

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

Related Items (19)

On the further relation between the (revised) Szeged index and the Wiener index of graphs ⋮ On extremal cacti with respect to the edge Szeged index and edge-vertex Szeged index ⋮ On the difference between the (revised) Szeged index and the Wiener index of cacti ⋮ The edge-Wiener index of zigzag nanotubes ⋮ On extremal cacti with respect to the revised Szeged index ⋮ On the difference between the revised Szeged index and the Wiener index ⋮ Tricyclic graphs with maximal revised Szeged index ⋮ On minimum revised edge Szeged index of bicyclic graphs ⋮ Inverse problem on the Steiner Wiener index ⋮ Improved bounds on the difference between the Szeged index and the Wiener index of graphs ⋮ Resistance distance-based graph invariants of subdivisions and triangulations of graphs ⋮ On extremal cacti with respect to the Szeged index ⋮ On the difference between the Szeged and the Wiener index ⋮ A lower bound of revised Szeged index of bicyclic graphs ⋮ Proofs of three conjectures on the quotients of the (revised) Szeged index and the Wiener index and beyond ⋮ ON WIENER INDEX OF GRAPH COMPLEMENTS ⋮ On the revised Szeged index of unicyclic graphs with given diameter ⋮ On the edge-Szeged index of unicyclic graphs with perfect matchings ⋮ On the edge-Szeged index of unicyclic graphs with given diameter

Uses Software

• AutoGraphiX

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• On a conjecture about the Szeged index
• Graphs whose Szeged and Wiener numbers differ by 4 and 5
• Wiener index versus Szeged index in networks
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
• Bicyclic graphs with maximal revised Szeged index
• Edge-contributions of some topological indices and arboreality of molecular graphs
• AutoGraphiX: a survey

This page was built for publication: The (revised) Szeged index and the Wiener index of a nonbipartite graph