PreprintarXiv licencearXiv
Spectral radius and edge-disjoint spanning trees of graphs with edge connectivity
Abstract
Let τ(G) denote the maximum number of pairwise edge-disjoint spanning trees contained in a graph G. Zhang and Fan [J. Graph Theory, 2026] posed the problem of determining the corresponding tight spectral-radius condition for every s-edge-connected graph with k+1≤ s≤2k−1, together with a characterization of the associated extremal graphs. In this paper, we completely resolve this problem.
Related
- Some results on the distance spectral radius and edge-disjoint spanning trees of graphs
- Independence number, essential connectivity and the distance spectral radius of graphs
- The Algebraic Connectivity and Laplacian Spectral Radius of Token Graphs
- Maximum and Minimum Spectral Radii in an Exceptional Family for Edge-Disjoint Spanning Trees
- Asymptotic maximum spectral radius of nonregular graphs
BibTeX
@misc{wei2026spectral,
title = {{Spectral radius and edge-disjoint spanning trees of graphs with edge connectivity}},
author = {Jia Wei and Muhuo Liu and Zhifu You and Hong-Jian Lai},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.18574},
eprint = {2610.18574},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.18574},
}
RIS
TY - UNPB
TI - Spectral radius and edge-disjoint spanning trees of graphs with edge connectivity
AU - Jia Wei
AU - Muhuo Liu
AU - Zhifu You
AU - Hong-Jian Lai
PY - 2026
DA - 2026/10/13
PB - arXiv
DO - 10.48550/arxiv.2610.18574
UR - https://arxiv.org/abs/2610.18574
AB - Let τ(G) denote the maximum number of pairwise edge-disjoint spanning trees contained in a graph G. Zhang and Fan [J. Graph Theory, 2026] posed the problem of determining the corresponding tight spectral-radius condition for every s-edge-connected graph with k+1≤ s≤2k−1, together with a characterization of the associated extremal graphs. In this paper, we completely resolve this problem.
ER -