A sharp lower bound on Steiner Wiener index for trees with given diameter
From MaRDI portal
Publication:1690239
DOI10.1016/J.DISC.2017.11.009zbMATH Open1378.05039OpenAlexW2776184136MaRDI QIDQ1690239FDOQ1690239
Authors: Lu Lu, Jiangxia Hou, Xun Chen, Qiongxiang Huang 
Publication date: 19 January 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2017.11.009
Recommendations
Cites Work
- Graph theory
- Title not available (Why is that?)
- A survey on graphs extremal with respect to distance-based topological indices
- Wiener index of trees: Theory and applications
- The Steiner Wiener index of a graph
- Distance in graphs
- Steiner distance in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (13)
- On the average Steiner 3-eccentricity of trees
- The Steiner \(k\)-eccentricity on trees
- Title not available (Why is that?)
- Extremal trees with respect to the Steiner Wiener index
- The extremal graphs of order trees and their topological indices
- The \(k\)-Szeged index of graphs
- 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
- The Steiner \(k\)-Wiener index of graphs with given minimum degree
- The upper bounds on the Steiner \(k\)-Wiener index in terms of minimum and maximum degrees
- On the Wiener indices of trees ordering by diameter-growing transformation relative to the pendent edges
- The Steiner Wiener index of trees with a given segment sequence
- The average Steiner 3-eccentricity of block graphs
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)
