On the difference between the (revised) Szeged index and the Wiener index of cacti
From MaRDI portal
Publication:1671315
DOI10.1016/j.dam.2018.03.038zbMath1394.05025OpenAlexW2795459849WikidataQ130041672 ScholiaQ130041672MaRDI QIDQ1671315
Sandi Klavžar, Shuchao Li, Huihui Zhang
Publication date: 6 September 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.038
Related Items (7)
Comparing Wiener, Szeged and revised Szeged index on cactus graphs ⋮ Wiener Index, Kirchhoff Index in Graphs with Given Girth and Maximum Degree ⋮ An inequality between variable Wiener index and variable Szeged index ⋮ Maximum Balaban index and sum-Balaban index of cacti ⋮ On the revised Szeged index of unicyclic graphs with given diameter ⋮ Cacti with maximal general sum-connectivity index ⋮ On the difference between the Szeged index and the Wiener index of cacti
Cites Work
- 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
- Orientations of graphs with maximum Wiener index
- 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
- Proofs of three conjectures on the quotients of the (revised) Szeged index and the Wiener index and beyond
- The \((n,n)\)-graphs with the first three extremal Wiener indices
- The Szeged and the Wiener index of graphs
- Wiener index of hexagonal systems
- On the difference between the Szeged and the Wiener index
- A lower bound of revised Szeged index of bicyclic graphs
- Graphs whose Szeged and Wiener numbers differ by 4 and 5
- Wiener index versus Szeged index in networks
- 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-preserving subgraphs of hypercubes
- On the canonical metric representation, average distance, and partial Hamming graphs
- Distance in graphs
- Wiener index of trees: Theory and applications
This page was built for publication: On the difference between the (revised) Szeged index and the Wiener index of cacti