On the average Steiner distance of graphs with presribed properties
From MaRDI portal
Publication:1372733
DOI10.1016/S0166-218X(97)00035-8zbMath0884.05040MaRDI QIDQ1372733
Ortrud R. Oellermann, Henda C. Swart, Peter Dankelmann
Publication date: 7 January 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Related Items
The Steiner Wiener index of a graph, The average Steiner 3-eccentricity of block graphs, A survey of sequences of central subgraphs, Average distance and domination number, Steiner 4-diameter, maximum degree and size of a graph, Average distance, minimum degree, and spanning trees, Steiner intervals in graphs, Inverse problem on the Steiner Wiener index, On Steiner degree distance of trees, On the average Steiner 3-eccentricity of trees, The Steiner \(k\)-eccentricity on trees, Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs, The Steiner Wiener index of trees with a given segment sequence, The Steiner \(k\)-Wiener index of graphs with given minimum degree, 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, Extremal trees with respect to the Steiner Wiener index, Nordhaus-Gaddum Type results for the Harary index of graphs, Unnamed Item, On the Steiner hyper-Wiener index of a graph, Extremal trees of a given degree sequence or segment sequence with respect to average Steiner 3-eccentricity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mean distance in a graph
- Average distance and domination number
- On the sum of all distances in a graph or digraph
- ON DISTANCES IN CHROMATIC GRAPHS
- The average distance and the independence number
- Edge-vulnerability and mean distance
- Distance in graphs
- Steiner distance in graphs
- The average Steiner distance of a graph
- Minimally 2-connected graphs.
- On Minimal Blocks
