Hamiltonian path decomposition of fan graphs
Applicable Analysis and Discrete Mathematics · 2026 · (00) · 4-4
DOI: 10.2298/aadm251124004d ↗Kurz gefasst
Fachartikel in der Zeitschrift Applicable Analysis and Discrete Mathematics, 2026. Verfasst von Mustafa Demir und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
This paper focuses on Hamiltonian path decompositions of fan graphs Fm,n which is the join graph \overline{K_m} + P_n where \overline{K_m} is an empty graph with m vertices and Pn is a path with n vertices. It is proved that Fm,n admits a Hamiltonian path decomposition (possibly with a near 1-factor leave) if and only if m = n?1 for all n ? 3. The result is proved make used of the method of graph amalgamations.
Zitieren
APA
Demir, M., & Piri, S. (2026). Hamiltonian path decomposition of fan graphs. Applicable Analysis and Discrete Mathematics, 4-4. https://doi.org/10.2298/aadm251124004d
Vancouver
Demir M, Piri S. Hamiltonian path decomposition of fan graphs. Applicable Analysis and Discrete Mathematics. 2026:4-4. doi:10.2298/aadm251124004d
BibTeX
@article{Demir2026,
author = {Demir, Mustafa and Piri, Semih},
title = {Hamiltonian path decomposition of fan graphs},
journal = {Applicable Analysis and Discrete Mathematics},
year = {2026},
number = {00},
pages = {4--4},
doi = {10.2298/aadm251124004d}
}
EUVIMED