Proofs of three conjectures on the quotients of the (revised) Szeged index and the Wiener index and beyond
From MaRDI portal
Publication:729760
DOI10.1016/j.disc.2016.09.007zbMath1351.05064OpenAlexW2556497445WikidataQ113877059 ScholiaQ113877059MaRDI QIDQ729760
Publication date: 22 December 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.09.007
Related Items (16)
Comparing Wiener, Szeged and revised Szeged index on cactus graphs ⋮ Peripheral Wiener index of trees and related questions ⋮ On revised Szeged index of a class of unicyclic graphs ⋮ 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 extremal cacti with respect to the revised Szeged index ⋮ On minimum revised edge Szeged index of bicyclic graphs ⋮ Extremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity index ⋮ A lower bound of revised Szeged index of bicyclic graphs ⋮ On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs ⋮ An inequality between variable Wiener index and variable Szeged index ⋮ On the extremal graphs with respect to the total reciprocal edge-eccentricity ⋮ On the revised Szeged index of unicyclic graphs with given diameter ⋮ Relation between the rank of a signed graph and the rank of its underlying graph ⋮ 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
- Unnamed Item
- On the further relation between the (revised) Szeged index and the Wiener index of graphs
- 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
- The \((n,n)\)-graphs with the first three extremal Wiener indices
- The Szeged and the Wiener index of graphs
- 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
- Distance in Graphs
- Edge-contributions of some topological indices and arboreality of molecular graphs
- AutoGraphiX: a survey
- Wiener index of trees: Theory and applications
This page was built for publication: Proofs of three conjectures on the quotients of the (revised) Szeged index and the Wiener index and beyond