The \(k\)-Szeged index of graphs
From MaRDI portal
Publication:2675837
DOI10.1016/j.disc.2022.113076zbMath1497.05042OpenAlexW4286470315MaRDI QIDQ2675837
Publication date: 26 September 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2022.113076
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Vertex degrees (05C07) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)
Cites Work
- The Steiner Wiener index of a graph
- Use of the Szeged index and the revised Szeged index for measuring network bipartivity
- On the revised Szeged index
- Distance-balanced graphs
- The Szeged and the Wiener index of graphs
- A sharp lower bound on Steiner Wiener index for trees with given diameter
- On the revised Szeged index of unicyclic graphs with given diameter
- Estimating the Estrada index
- On the Szeged index of unicyclic graphs with given diameter
- Minimum Szeged index among unicyclic graphs with perfect matchings
- On the sum of all distances in a graph or digraph
- Wiener index of trees: Theory and applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item