The average Steiner 3-eccentricity of block graphs
From MaRDI portal
Publication:2143828
DOI10.1007/s12190-020-01473-xzbMath1487.05063OpenAlexW3120569199MaRDI QIDQ2143828
Publication date: 31 May 2022
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-020-01473-x
Related Items (1)
Cites Work
- The Steiner Wiener index of a graph
- Eccentricity sums in trees
- On the extremal properties of the average eccentricity
- Convex sets in lexicographic products of graphs
- A proof of the conjecture regarding the sum of domination number and average eccentricity
- The Steiner tree problem
- On the average Steiner distance of graphs with presribed properties
- A sharp lower bound on Steiner Wiener index for trees with given diameter
- Inverse problem on the Steiner Wiener index
- Average eccentricity, \(k\)-packing and \(k\)-domination in graphs
- On Steiner degree distance of trees
- Steiner convex sets and Cartesian product
- On the generalized Wiener polarity index of trees with a given diameter
- On the Steiner median of a tree
- On the edge metric dimension of graphs
- Upper bounds on the average eccentricity of \(K_3\)-free and \(C_4\)-free graphs
- On the Steiner hyper-Wiener index of a graph
- Upper bounds on the average eccentricity
- Steiner distance in graphs
- Steiner Distance in Product Networks
- The average Steiner distance of a graph
- Steiner (revised) Szeged index of graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The average Steiner 3-eccentricity of block graphs
