Extremal trees of a given degree sequence or segment sequence with respect to average Steiner 3-eccentricity
From MaRDI portal
(Redirected from Publication:2096310)
Recommendations
Cites work
- Corrigendum: The extremal values of the Wiener index of a tree with given degree sequence
- Extremal cover cost and reverse cover cost of trees with given segment sequence
- Extremal problems for trees with given segment sequence
- Extremal trees of given segment sequence with respect to some eccentricity-based invariants
- scientific article; zbMATH DE number 5627542 (Why is no real title available?)
- scientific article; zbMATH DE number 6750302 (Why is no real title available?)
- Inequalities: theory of majorization and its applications
- Maximum Wiener index of trees with given degree sequence
- On segment sequences and the Wiener index of trees
- On Steiner degree distance of trees
- On the average Steiner 3-eccentricity of trees
- On the average Steiner distance of graphs with presribed properties
- On the extremal values for the Mostar index of trees with given degree sequence
- On the Steiner hyper-Wiener index of a graph
- Steiner (revised) Szeged index of graphs
- Steiner convex sets and Cartesian product
- Steiner distance in graphs
- Steiner distance in product networks
- Steiner Gutman index
- Steiner Harary index
- The average Steiner 3-eccentricity of block graphs
- The average Steiner distance of a graph
- The extremal values of the Wiener index of a tree with given degree sequence
- The number of subtrees of trees with given degree sequence
- The Steiner \(k\)-eccentricity on trees
- The Steiner Wiener index of a graph
- The Steiner Wiener index of trees with a given segment sequence
Cited in
(4)
This page was built for publication: Extremal trees of a given degree sequence or segment sequence with respect to average Steiner 3-eccentricity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096310)