Comparison between Szeged indices of graphs
From MaRDI portal
Publication:5129752
Recommendations
Cites work
- Cactus graphs with minimum edge revised Szeged index
- Comparison between the Szeged index and the eccentric connectivity index
- Graph theory with applications
- On extremal cacti with respect to the revised Szeged index
- On the revised Szeged index
- Proof of conjectures on adjacency eigenvalues of graphs
- Revised and edge revised Szeged indices of graphs
- Some results on the reciprocal sum-degree distance of graphs
- Some variants of the Szeged index under rooted product of graphs
- Use of the Szeged index and the revised Szeged index for measuring network bipartivity
Cited in
(10)- scientific article; zbMATH DE number 7103374 (Why is no real title available?)
- Relationship between edge Szeged and edge Wiener indices of graphs
- Some variants of the Szeged index under rooted product of graphs
- Szeged index, edge Szeged index, and semi-star trees
- The \(k\)-Szeged index of graphs
- Computing Szeged index of graphs on triples
- Improved bounds on the difference between the Szeged index and the Wiener index of graphs
- Some inequalities for Szeged-like topological indices of graphs
- scientific article; zbMATH DE number 7250395 (Why is no real title available?)
- Comparison between the Szeged index and the eccentric connectivity index
This page was built for publication: Comparison between Szeged indices of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5129752)