Decomposition of Regular Bipartite Graphs Into Hamiltonian Cycles (Paths) and S3

V. Nalini and S. Jeevadoss

Journal of Mathematics, 2025, vol. 2025, 1-11

Abstract: Let G be either a complete bipartite graph with n (even) vertices in each partite or a complete bipartite graph with n (odd) vertices in each partite plus a 1†factor. A Hamiltonian cycle (respectively, path) of G is a cycle (respectively, path) that visits each vertex exactly once. In this paper, we determine the necessary and sufficient conditions for decomposing the graph G into λ copies of Hamiltonian cycles (or paths) and μ copies of the S3, a star with three edges if and only if n2+εn=2nλ+3μor n2+εn=2n−1λ+3μ, where ε=1 if n is odd and ε=0 if n is even.

Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2025/2349979.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2025/2349979.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:2349979

DOI: 10.1155/jom/2349979

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().