On the average Steiner distance of graphs with presribed properties
The Steiner distance of a set \(S\) of vertices in a connected graph \(G\), \(d_G(S)\), is the number of edges in a smallest Steiner tree for \(S\). The average Steiner distance \(\mu _n(G)\) of \(G\) is the average of the Steiner distances of all \(n\)-subsets of \(V(G)\). The authors also define the \(n\)-diameter, \(n\)-radius and further notions related to distances in such a way that \(n=2\) corresponds to the standard notions. Generalizing several results on the average distance (see \textit{R. C. Entringer, D. E. Jackson} and \textit{D. A. Snyder} [Czech. Math. J. 26(101), 283-296 (1976; Zbl 0329.05112)], \textit{J. Plesník} [J. Graph Theory 8, 1-21 (1984; Zbl 0552.05048)] and \textit{I. Tomescu} and \textit{R. A. Melter} [Q. J. Math., Oxf. II. Ser. 40, No. 160, 475-480 (1989; Zbl 0702.05034)]), they give bounds on the average Steiner distance related to the \(n\)-diameter, the chromatic number, and others.
- Average distance and domination number
- Distance in graphs
- Edge-vulnerability and mean distance
- scientific article; zbMATH DE number 4202292 (Why is no real title available?)
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 3328106 (Why is no real title available?)
- Mean distance in a graph
- Minimally 2-connected graphs.
- ON DISTANCES IN CHROMATIC GRAPHS
- On Minimal Blocks
- On the sum of all distances in a graph or digraph
- Steiner distance in graphs
- The average distance and the independence number
- The average Steiner distance of a graph
- Steiner distance stable graphs
- Average distance and domination number
- Steiner intervals in graphs
- Inverse problem on the Steiner Wiener index
- On Steiner degree distance of trees
- The Steiner Wiener index of trees with a given segment sequence
- 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 of a given degree sequence or segment sequence with respect to average Steiner 3-eccentricity
- The average Steiner 3-eccentricity of block graphs
- 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
- On the Steiner hyper-Wiener index of a graph
- The Steiner Wiener index of a graph
- Disproof of a conjecture about average Steiner distance.
- scientific article; zbMATH DE number 1355276 (Why is no real title available?)
- scientific article; zbMATH DE number 1355283 (Why is no real title available?)
- Nordhaus-Gaddum type results for the Harary index of graphs
- The average Steiner distance of a graph
- A survey of sequences of central subgraphs
- Average distance, minimum degree, and spanning trees
- Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs
- Steiner 4-diameter, maximum degree and size of a graph
- Steiner Wiener index of graph products
- Extremal trees with respect to the Steiner Wiener index
- The average Steiner \(( 3 , 2 )\)-eccentricity of trees
- Extremal problems on Steiner k-distances
- The k-radius of 2-connected graphs
This page was built for publication: On the average Steiner distance of graphs with presribed properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1372733)
