On the further relation between the (revised) Szeged index and the Wiener index of graphs
From MaRDI portal
Publication:277640
DOI10.1016/j.dam.2016.01.029zbMath1335.05061OpenAlexW2293554533MaRDI QIDQ277640
Lifang Zhao, Huihui Zhang, Shuchao Li
Publication date: 2 May 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.01.029
Related Items (17)
Comparing Wiener, Szeged and revised Szeged index on cactus graphs ⋮ Topological Efficiency of Some Product 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 ⋮ On the sharp bounds of bicyclic graphs regarding edge Szeged index ⋮ On the Szeged index of unicyclic graphs with given diameter ⋮ On extremal cacti with respect to the revised Szeged index ⋮ On minimum revised edge Szeged index of bicyclic graphs ⋮ Minimum Szeged index among unicyclic graphs with perfect matchings ⋮ On extremal cacti with respect to the Szeged index ⋮ A lower bound of revised Szeged index of bicyclic graphs ⋮ Wiener index, Harary index and graph properties ⋮ Proofs of three conjectures on the quotients of the (revised) Szeged index and the Wiener index and beyond ⋮ On the revised Szeged index of unicyclic graphs with given diameter ⋮ On the difference between the Szeged index and the Wiener index of cacti ⋮ On the edge-Szeged index of unicyclic graphs with given diameter ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the difference between the revised Szeged index and the Wiener index
- 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
- Extremal graphs with respect to the vertex PI 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
- The (revised) Szeged index and the Wiener index of a nonbipartite graph
- Improved bounds on the difference between the Szeged index and the Wiener index of graphs
- Bicyclic graphs with maximal revised Szeged index
- On the sum of all distances in bipartite graphs
- Edge-contributions of some topological indices and arboreality of molecular graphs
- AutoGraphiX: a survey
This page was built for publication: On the further relation between the (revised) Szeged index and the Wiener index of graphs