Extremal trees of a given degree sequence or segment sequence with respect to average Steiner 3-eccentricity
From MaRDI portal
Publication:2096310
DOI10.1016/j.amc.2022.127556OpenAlexW4297492142MaRDI QIDQ2096310
Wanting Sun, Xin Liu, Lixia Yan, Shuchao Li
Publication date: 16 November 2022
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2022.127556
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Steiner Wiener index of a graph
- Extremal problems for trees with given segment sequence
- Extremal trees of given segment sequence with respect to some eccentricity-based invariants
- The extremal values of the Wiener index of a tree with given degree sequence
- Corrigendum: The extremal values of the Wiener index of a tree with given degree sequence
- On the average Steiner distance of graphs with presribed properties
- On Steiner degree distance of trees
- Steiner convex sets and Cartesian product
- The Steiner Wiener index of trees with a given segment sequence
- The average Steiner 3-eccentricity of block graphs
- On the average Steiner 3-eccentricity of trees
- The Steiner \(k\)-eccentricity on trees
- Extremal cover cost and reverse cover cost of trees with given segment sequence
- On the Steiner hyper-Wiener index of a graph
- On the extremal values for the Mostar index of trees with given degree sequence
- Steiner distance in graphs
- Steiner Distance in Product Networks
- The average Steiner distance of a graph
- The Maximum Wiener Index of Trees with Given Degree Sequences
- Steiner (revised) Szeged index of graphs
- The Number of Subtrees of Trees with Given Degree Sequence
- Inequalities: theory of majorization and its applications
This page was built for publication: Extremal trees of a given degree sequence or segment sequence with respect to average Steiner 3-eccentricity
