Cover Image

On the Steiner $k$-diameter and Steiner ($k,k^{\prime}$)-radius of trees

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhang, Qingnan, Tian, Yingzhi
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Some sharp bounds on the average Steiner (k, l)-eccentricity for trees
by: Zeng, Cheng, et al.
Published: (2025)

Extremal Problems for the Family of $k$-Strongly Connected Digraphs
by: Wang, Qinglin, et al.
Published: (2026)

Proof a conjecture on connectivity keeping odd paths in k-connected bipartite graphs
by: Yang, Qing, et al.
Published: (2022)

Spectral radius and rainbow $k$-factors of graphs
by: Zhang, Liwen, et al.
Published: (2025)

Completely independent Steiner trees and corresponding tree connectivity
by: Yuan, Jun, et al.
Published: (2025)

Graphs with a given conditional diameter that maximize the Wiener index
by: An, Junfeng, et al.
Published: (2024)

The spectral radius of $k$-chromatic $r$-graphs
by: Liu, Xizhi, et al.
Published: (2026)

Constructing edge-disjoint Steiner trees in Cartesian product networks
by: Li, Rui, et al.
Published: (2023)

k-non-crossing trees and edge statistics modulo k
by: Prodinger, Helmut
Published: (2024)

Improved bound on the number of edges of diameter-$k$-critical graphs
by: Wang, Xiaolin, et al.
Published: (2024)

Spanning k-trees and distance spectral radius in graphs
by: Zhou, Sizhong, et al.
Published: (2023)

Oriented Steiner Triple Systems, Steiner Products, and Dynamics
by: Kettinger, Jake, et al.
Published: (2025)

Distance spectral radius conditions for perfect $k$-matching, generalized factor-criticality (bicriticality) and $k$-$d$-criticality of graphs
by: Yang, Kexin, et al.
Published: (2026)

Constructing disjoint Steiner trees in Sierpiński graphs
by: Yang, Chenxu, et al.
Published: (2023)

Spectral radius and k-factor-critical graphs
by: Zhou, Sizhong, et al.
Published: (2023)

Bounding mean orders of sub-$k$-trees of $k$-trees
by: Cambie, Stijn, et al.
Published: (2023)

On Ramsey number of Steiner systems
by: Basu, Ayush, et al.
Published: (2026)

Pairs in Nested Steiner Quadruple Systems
by: Chee, Yeow Meng, et al.
Published: (2024)

Spectral radius and rainbow $k$-factors in a bipartite graph family
by: Chen, Meng, et al.
Published: (2026)

Steiner trees with infinitely many terminals on the sides of an angle
by: Cherkashin, Danila, et al.
Published: (2024)

$C_{2k+1}$-coloring of bounded-diameter graphs
by: Piecyk, Marta
Published: (2024)

Odd coloring of $k$-trees
by: Kashima, Masaki, et al.
Published: (2025)

Spectral radius, toughness and $k$-factor of graphs
by: Chen, Yuanyuan, et al.
Published: (2026)

Embedding loose trees in $k$-uniform hypergraphs
by: Chen, Yaobin, et al.
Published: (2025)

Tropical $k$-means clustering for phylogenetic trees
by: Lenzen, Fabian, et al.
Published: (2026)

On the $(k+2,k)$-problem of Brown, Erdős and Sós for even integers $k$
by: Wang, Yan, et al.
Published: (2026)

Steiner triple systems with high discrepancy
by: Gishboliner, Lior, et al.
Published: (2025)

Enumerations of 1-rotational Steiner systems
by: Hetman, Ivan, et al.
Published: (2025)

Arc-disjoint Steiner Cycles in Digraphs
by: Bai, Jie, et al.
Published: (2026)

Universal Ahlfors--David regularity of Steiner trees
by: Cherkashin, Danila, et al.
Published: (2026)

Completely Independent Steiner Trees
by: Maheshwari, Anil, et al.
Published: (2026)

List colorings of $k$-partite $k$-graphs
by: Dhawan, Abhishek
Published: (2023)

On the $(k+2,k)$-problem of Brown, Erdős and Sós for $k=5,6,7$
by: Glock, Stefan, et al.
Published: (2024)

A combinatorial proof of a relationship between maximal $(2k-1,2k+1)$ and $(2k-1,2k,2k+1)$-cores
by: Nath, Rishi, et al.
Published: (2015)

A linear algorithm for radio $k$-coloring of powers of paths having small diameters
by: Chakraborty, Dipayan, et al.
Published: (2021)

Sufficient conditions for spanning $k$-trees in tough graphs
by: Jia, Caili, et al.
Published: (2026)

Spectral radius and perfect k-matchings in t-connected graphs
by: Pan, Quanru, et al.
Published: (2026)

On integers with many representations as the sum of $k$th powers of primes
by: Aggarwal, Anay
Published: (2025)

Steiner 3-designs as extensions
by: Kiermaier, Michael, et al.
Published: (2025)

The distance spectral radius of $k$-uniform hypertrees with given number of vertices of maximum degree
by: Liu, Xiaoqi, et al.
Published: (2024)