On the existence of a cyclic near-Rrsolvable (6n+4)-cycle system of 2K12n+9
In this article, we prove the existence of a simple cyclic near-resolvable - cycle system of for by the method of constructing its starter. Then, some new properties and results related to this construction are formulated.
Main Authors: | Aldiabat, Raja'i, Ibrahim, Haslinda, Karim, Sharmila |
---|---|
Format: | Article |
Language: | English |
Published: |
2019
|
Subjects: | |
Online Access: | https://repo.uum.edu.my/id/eprint/26924/1/JM%202019%2010.pdf |
Similar Items
-
On the Existence of a Cyclic Near-Resolvable (6n + 4)-Cycle
System of 2k12n+9
by: Aldiabat, Raja’i, et al.
Published: (2019) -
Cyclic near-Hamiltonian cycle decomposition of 2-fold complete graph
by: Aldiabat, Raja’i, et al.
Published: (2019) -
On Cyclic Near-Hamiltonian Cycle System of the Complete
Multigraph
by: Aldiabat, Raja'i, et al.
Published: (2017) -
Near-Compatible Factorization
by: Aldiabat, Raja’i, et al.
Published: (2018) -
Butterfly Triple System Algorithm Based on Graph Theory
by: Ibrahim, Haslinda, et al.
Published: (2022)