A sharp lower bound on Steiner Wiener index for trees with given diameter
From MaRDI portal
Publication:1690239
Recommendations
Cites work
- scientific article; zbMATH DE number 5619543 (Why is no real title available?)
- scientific article; zbMATH DE number 4074878 (Why is no real title available?)
- A survey on graphs extremal with respect to distance-based topological indices
- Distance in graphs
- Graph theory
- Steiner Wiener index of graph products
- Steiner distance in graphs
- The Steiner Wiener index of a graph
- Wiener index of trees: Theory and applications
Cited in
(15)- Extremal trees with respect to the Steiner Wiener index
- Steiner diameter, maximum degree and size of a graph
- Bounding the \(k\)-Steiner Wiener and Wiener-type indices of trees in terms of eccentric sequence
- On the average Steiner 3-eccentricity of trees
- The Steiner \(k\)-eccentricity on trees
- The Steiner \(k\)-Wiener index of graphs with given minimum degree
- The Steiner Wiener index of trees with given diameter
- The Steiner Wiener index of trees with a given segment sequence
- The average Steiner 3-eccentricity of block graphs
- The \(k\)-Szeged index of graphs
- On the Wiener indices of trees ordering by diameter-growing transformation relative to the pendent edges
- The extremal graphs of order trees and their topological indices
- Steiner Wiener index and line graphs of trees
- The Steiner Wiener index of trees with given bipartition
- The upper bounds on the Steiner \(k\)-Wiener index in terms of minimum and maximum degrees
This page was built for publication: A sharp lower bound on Steiner Wiener index for trees with given diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1690239)