Comparison between Szeged indices of graphs
DOI10.2989/16073606.2019.1599077zbMATH Open1450.05011OpenAlexW2939321148WikidataQ128036092 ScholiaQ128036092MaRDI QIDQ5129752FDOQ5129752
Authors: A. R. Ashrafi, Kinkar Ch. Das, Ali Ghalavand 
Publication date: 23 October 2020
Published in: Quaestiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2989/16073606.2019.1599077
Recommendations
Applications of graph theory (05C90) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Distance in graphs (05C12) Connectivity (05C40)
Cites Work
- Proof of conjectures on adjacency eigenvalues of graphs
- Graph theory with applications
- Some results on the reciprocal sum-degree distance of graphs
- Use of the Szeged index and the revised Szeged index for measuring network bipartivity
- On the revised Szeged index
- Revised and edge revised Szeged indices of graphs
- Cactus graphs with minimum edge revised Szeged index
- On extremal cacti with respect to the revised Szeged index
- Comparison between the Szeged index and the eccentric connectivity index
- Some variants of the Szeged index under rooted product of graphs
Cited In (10)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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)
