The average Steiner 3-eccentricity of block graphs
From MaRDI portal
Cites work
- A proof of the conjecture regarding the sum of domination number and average eccentricity
- A sharp lower bound on Steiner Wiener index for trees with given diameter
- Average eccentricity, \(k\)-packing and \(k\)-domination in graphs
- Convex sets in lexicographic products of graphs
- Eccentricity sums in trees
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- scientific article; zbMATH DE number 2114503 (Why is no real title available?)
- Introduction to algorithms
- Inverse problem on the Steiner Wiener index
- On AGX conjectures regarding average eccentricity
- On average eccentricity
- On Steiner degree distance of trees
- On the average Steiner distance of graphs with presribed properties
- On the edge metric dimension of graphs
- On the extremal properties of the average eccentricity
- On the generalized Wiener polarity index of trees with a given diameter
- On the Steiner hyper-Wiener index of a graph
- On the Steiner median of a tree
- Steiner (revised) Szeged index of graphs
- Steiner convex sets and Cartesian product
- Steiner distance in graphs
- Steiner distance in product networks
- Steiner Gutman index
- The average eccentricity, spanning trees of plane graphs, size and order
- The average Steiner distance of a graph
- The Steiner tree problem
- The Steiner Wiener index of a graph
- Upper bounds on the average eccentricity
- Upper bounds on the average eccentricity of K₃-free and C₄-free graphs
Cited in
(4)
This page was built for publication: The average Steiner 3-eccentricity of block graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2143828)