EUVIMEDEUVIMED entdecken
Crossref

Spectral Radius and Edge‐Disjoint Spanning Trees of Graphs With Prescribed Edge Connectivity

Yuke Zhang, Dandan Fan

Journal of Graph Theory · 2026-06 · 112 (2) · 128-144

DOI: 10.1002/jgt.70017 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 16.03.2026. Verfasst von Yuke Zhang und 1 weiteren Autor:innen. Die Arbeit nennt 25 Literaturangaben. Gefördert von: National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Let and denote the edge connectivity and the maximum number of edge‐disjoint spanning trees contained in a graph , respectively. Fan, Gu, and Lin studied a tight spectral condition of a connected graph to guarantee . The famous theorem of Tutte and Nash‐Williams implies that and are closely related with , so it is interesting to explore conditions on a graph with to warrant . Since graphs with edge‐disjoint spanning trees are ‐edge‐connected, the converse does not hold. We initially provide a tight spectral radius condition to guarantee in ‐edge‐connected graphs with a unique extremal graph characterization. Moreover, an extensive spectral condition on in ‐edge‐connected graphs with fixed minimum degree is determined. For , we further study analogous results on 3‐edge‐connected graphs to ensure , which implies comprehensive spectral arguments on for .

Förderung

  • National Natural Science Foundation of China

Zitieren

APA

Zhang, Y., & Fan, D. (2026). Spectral Radius and Edge‐Disjoint Spanning Trees of Graphs With Prescribed Edge Connectivity. Journal of Graph Theory, 112(2), 128-144. https://doi.org/10.1002/jgt.70017

Vancouver

Zhang Y, Fan D. Spectral Radius and Edge‐Disjoint Spanning Trees of Graphs With Prescribed Edge Connectivity. Journal of Graph Theory. 2026;112(2):128-144. doi:10.1002/jgt.70017

BibTeX
@article{Zhang2026,
  author = {Zhang, Yuke and Fan, Dandan},
  title = {Spectral Radius and Edge‐Disjoint Spanning Trees of Graphs With Prescribed Edge Connectivity},
  journal = {Journal of Graph Theory},
  year = {2026},
  volume = {112},
  number = {2},
  pages = {128--144},
  doi = {10.1002/jgt.70017}
}
Kostenlos starten →