<link rel="stylesheet" href="styles.f3b1fba60ec7970c.css">

Publication:
Hamiltonian Path Decomposition of Fan Graphs

Loading...
Thumbnail Image

Institution Authors

Organizational Units

Organizational Units

Advisor

Editor

Journal Title

Journal ISSN

Volume Title

Type:

Publisher

National Library of Serbia

DOI

10.2298/aadm251124004d

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.

Description

Journal or Series

Applicable Analysis and Discrete Mathematics

ISSN

1452-8630

ISBN

Keywords

Citation

Collections

Endorsement

Review

Supplemented By

Referenced By

Rights and licensing

info:eu-repo/semantics/openAccess

Research Projects

Journal Issue

Related Patent

Google Scholar
Scholar'da Ara ↗
Altmetric
Dimensions
PlumX Metrikleri
BIP! Indicators