Hamiltonian path decomposition of fan graphs

Read full text Summarise with VIRAT
Authors: Mustafa Demir, Semih PİRİ
Cited by: 0
References: 4

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

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.

Fields of Study & Subjects

Advanced Graph Theory Research Advanced Combinatorial Mathematics Finite Group Theory Research

Publication details

Journal / source
Applicable Analysis and Discrete Mathematics
Issue
00
Pages
4–4
Publication date
1 January 2026
Language
EN