EUVIMEDEUVIMED entdecken
Crossref

Sufficient conditions for spanning trees with bounded total excess

Sufang Wang

RAIRO - Operations Research · 17.11.2026

DOI: 10.1051/ro/2026123 ↗

Kurz gefasst

Fachartikel in der Zeitschrift RAIRO - Operations Research, online erschienen am 17.11.2026. Verfasst von Sufang Wang.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Let G be a connected graph and let k ≥ 2 be an integer. A spanning tree with maximum degree at most k is called a spanning k-tree. As a generalization of the above concept, the concept of total excess is defined as follows: for a spanning subgraph H of a connected graph G and an integer t, the total t-excess te(H,t) is defined by te(H,t) = X max{0,dH(v) − t}, v∈V(H) where dH(v) is the degree of v in H. It is easy to see that for a spanning tree T, T is a spanning k-tree if and only if te(T,t) = 0. Let e(G) and ρa(G) denote the size and the Aa-spectral radius of G, respectively. In this work, we put forward two sufficient conditions for a connected graph G containing a spanning tree T with te(T,k) ≤ k − 3 via the size or the Aa-spectral radius.

Zitieren

APA

Wang, S. (2026). Sufficient conditions for spanning trees with bounded total excess. RAIRO - Operations Research. https://doi.org/10.1051/ro/2026123

Vancouver

Wang S. Sufficient conditions for spanning trees with bounded total excess. RAIRO - Operations Research. 2026. doi:10.1051/ro/2026123

BibTeX
@article{Wang2026,
  author = {Wang, Sufang},
  title = {Sufficient conditions for spanning trees with bounded total excess},
  journal = {RAIRO - Operations Research},
  year = {2026},
  doi = {10.1051/ro/2026123}
}
Kostenlos starten →