Metraipolis › archive › dc_955813cbfef6

Spanning tree with bounded degree sum of two adjacent vertices — arXiv:2611.01020

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.01020
License (as archived)
CC0-1.0
Archived
2026-11-03T11:36:41.448Z
SHA-256 of the archived text
c0edfe7b3ccd824eacaf2919ccf314571944a0b845e1b022ea944c85288aef01
Stable URL of this page
https://metraipolis.com/documento/dc_955813cbfef6

How to cite

Spanning tree with bounded degree sum of two adjacent vertices — arXiv:2611.01020 — arXiv (en), https://arxiv.org/abs/2611.01020 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_955813cbfef6 (Metraipolis archive dc_955813cbfef6, sha256 c0edfe7b3ccd824eacaf2919ccf314571944a0b845e1b022ea944c85288aef01)
BibTeX
@misc{dc955813cbfef6,
  title = {Spanning tree with bounded degree sum of two adjacent vertices — arXiv:2611.01020},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.01020},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_955813cbfef6; sha256 c0edfe7b3ccd824eacaf2919ccf314571944a0b845e1b022ea944c85288aef01},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01020. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In this paper, we first give a sharp sufficient condition on degree sum for a connected graph to have a spanning tree whose maximum of degree sum of two adjacent vertices are bounded. These improve some previous results on the spanning tree with bounded maximum degree. Next, we also use our main result to study the generalized rainbow connection of graphs. In particular, we give some degree sum conditions for a connected graphs to have a bounded (1,2)- rainbow connection number.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.01020 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T11:05:22.255Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).