EUVIMEDEUVIMED entdecken
Crossref

A Short Note on Several Conditions for the Existence of a Component Factor in Graphs

Shuai Kou, Weihua Yang, Xiaxia Guan

Journal of Interconnection Networks · 05.08.2026

DOI: 10.1142/s0219265926500155 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Interconnection Networks, online erschienen am 05.08.2026. Verfasst von Shuai Kou und 2 weiteren Autor:innen. Gefördert von: National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Let [Formula: see text] be a graph, and let [Formula: see text] and [Formula: see text] be two integers with [Formula: see text]. A [Formula: see text]-factor of [Formula: see text] is a spanning subgraph in which every connected component is isomorphic to an element of [Formula: see text], where [Formula: see text] is a special family of trees. In this paper, for a graph, we give a sufficient and necessary condition to have [Formula: see text]-factors based on the binding number. In addition, we propose several sufficient conditions for the existence of [Formula: see text]-factors. Furthermore, we show that some bounds are best possible.

Förderung

  • National Natural Science Foundation of China

Zitieren

APA

Kou, S., Yang, W., & Guan, X. (2026). A Short Note on Several Conditions for the Existence of a Component Factor in Graphs. Journal of Interconnection Networks. https://doi.org/10.1142/s0219265926500155

Vancouver

Kou S, Yang W, Guan X. A Short Note on Several Conditions for the Existence of a Component Factor in Graphs. Journal of Interconnection Networks. 2026. doi:10.1142/s0219265926500155

BibTeX
@article{Kou2026,
  author = {Kou, Shuai and Yang, Weihua and Guan, Xiaxia},
  title = {A Short Note on Several Conditions for the Existence of a Component Factor in Graphs},
  journal = {Journal of Interconnection Networks},
  year = {2026},
  doi = {10.1142/s0219265926500155}
}
Kostenlos starten →