EUVIMEDEUVIMED entdecken
Crossref

Connectivity preserving trees in k ‐connected or k ‐edge‐connected graphs

Toru Hasunuma

Journal of Graph Theory · 2023-03 · 102 (3) · 423-435

DOI: 10.1002/jgt.22878 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 15.08.2022. Verfasst von Toru Hasunuma. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 21 Literaturangaben. Gefördert von: Japan Society for the Promotion of Science.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We show that for and any tree of order , every ‐connected (respectively, ‐edge‐connected) graph with minimum degree at least contains a subtree such that is ‐connected (respectively, ‐edge‐connected), where denotes the maximum degree of . We also show that for any and any tree of order , every ‐connected (respectively, ‐edge‐connected) graph of order with minimum degree at least where contains a subtree such that is ‐connected (respectively, ‐edge‐connected). The lower bound of on the minimum degree of can be improved to under several restrictions or assumptions.

Förderung

  • Japan Society for the Promotion of Science

Zitieren

APA

Hasunuma, T. (2023). Connectivity preserving trees in k ‐connected or k ‐edge‐connected graphs. Journal of Graph Theory, 102(3), 423-435. https://doi.org/10.1002/jgt.22878

Vancouver

Hasunuma T. Connectivity preserving trees in k ‐connected or k ‐edge‐connected graphs. Journal of Graph Theory. 2023;102(3):423-435. doi:10.1002/jgt.22878

BibTeX
@article{Hasunuma2023,
  author = {Hasunuma, Toru},
  title = {Connectivity preserving trees in k ‐connected or k ‐edge‐connected graphs},
  journal = {Journal of Graph Theory},
  year = {2023},
  volume = {102},
  number = {3},
  pages = {423--435},
  doi = {10.1002/jgt.22878}
}
Kostenlos starten →