English

Some sharp bounds on the average Steiner (k, l)-eccentricity for trees

Combinatorics 2025-07-22 v7

Abstract

In this paper we introduce some transformations for trees that do not increase the average Steiner (k,l)(k,l)-eccentricity for all 0lkn0\leq l\leq k\leq n. Using these transformations, we obtain some sharp bounds on the average Steiner (k,l)(k,l)-eccentricity for trees with some certain conditions, including given nodes, given diameter, given max degree and given leaves, and get the corresponding extremal trees as well.

Keywords

Cite

@article{arxiv.2506.17915,
  title  = {Some sharp bounds on the average Steiner (k, l)-eccentricity for trees},
  author = {Cheng Zeng and Gengji Li},
  journal= {arXiv preprint arXiv:2506.17915},
  year   = {2025}
}

Comments

14 pages, 6 figures

R2 v1 2026-07-01T03:28:11.364Z