Upper bounds on the Steiner diameter of a graph
From MaRDI portal
Publication:444450
DOI10.1016/J.DAM.2012.03.031zbMATH Open1245.05031OpenAlexW2080405637MaRDI QIDQ444450FDOQ444450
Authors: Patrick Ali, Peter Dankelmann, Simon Mukwembi 
Publication date: 14 August 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.03.031
Recommendations
Cites Work
Cited In (19)
- Steiner 4-diameter, maximum degree and size of a graph
- The Steiner Wiener index of a graph
- A note on the Steiner \(k\)-radius and Steiner \(k\)-diameter
- Inverse problem on the Steiner Wiener index
- Bounds on the Steiner radius of a graph
- A note on the Steiner \(k\)-diameter of tensor product networks
- Steiner diameter, maximum degree and size of a graph
- Nordhaus-Gaddum type results for the Harary index of graphs
- Improved upper bounds for the Steiner ratio
- The Steiner \(k\)-Wiener index of graphs with given minimum degree
- The Steiner distance problem for large vertex subsets in the hypercube
- The upper bounds on the Steiner \(k\)-Wiener index in terms of minimum and maximum degrees
- Steiner diameter of 3, 4 and 5-connected maximal planar graphs
- The Steiner diameter of a graph
- On Steiner degree distance of trees
- Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs
- Title not available (Why is that?)
- Steiner Harary index
- The Steiner diameter of a graph with prescribed girth
This page was built for publication: Upper bounds on the Steiner diameter of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q444450)
