EUVIMEDEUVIMED entdecken
Open Access · CC0

The existence of a {P2, C3, P5, T (3)}-factor based on the size or the Aα-spectral radius of graphs

Xianglong Zhang, Lihua You

Filomat · 2025 · 39 (20) · 7077-7091

DOI: 10.2298/fil2520077z ↗

Kurz gefasst

Fachartikel in der Zeitschrift Filomat, 2025. Verfasst von Xianglong Zhang und 1 weiteren Autor:innen. Die Arbeit nennt 17 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Let G be a connected graph of order n. A {P2, C3, P5, T (3)}-factor of G is a spanning subgraph of G such that each component is isomorphic to a member in {P2, C3, P5, T (3)}, where T (3) is a {1, 2, 3}-tree. The A?-spectral radius of G is denoted by ?? (G). In this paper, we obtain a lower bound on the size or the A?-spectral radius for ? ? [0, 1) of G to guarantee that G has a {P2, C3, P5, T (3)}-factor, and construct an extremal graph to show that the bound on A?-spectral radius is optimal.

Zitieren

APA

Zhang, X., & You, L. (2025). The existence of a {P2, C3, P5, T (3)}-factor based on the size or the Aα-spectral radius of graphs. Filomat, 39(20), 7077-7091. https://doi.org/10.2298/fil2520077z

Vancouver

Zhang X, You L. The existence of a {P2, C3, P5, T (3)}-factor based on the size or the Aα-spectral radius of graphs. Filomat. 2025;39(20):7077-7091. doi:10.2298/fil2520077z

BibTeX
@article{Zhang2025,
  author = {Zhang, Xianglong and You, Lihua},
  title = {The existence of a P2, C3, P5, T (3)-factor based on the size or the Aα-spectral radius of graphs},
  journal = {Filomat},
  year = {2025},
  volume = {39},
  number = {20},
  pages = {7077--7091},
  doi = {10.2298/fil2520077z}
}
Kostenlos starten →