Decomposition of the cartesian product of complete graphs into paths and cycles of length six
Let \(P_k\) and \(C_k\) respectively denote a path and a cycle on \(k\) vertices. In this paper, we give necessary and sufficient conditions for the existence of a complete \(\left\{P_7,C_6\right\}\)-decomposition of the cartesian product of complete graphs.
Authors
- A. Muthusamy (ORCID: https://orcid.org/0000-0001-9014-6916)
- A. Pauline Ezhilarasi (ORCID: https://orcid.org/0000-0003-0853-9492)
Publication Details
- Journal
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Published
- 2025-03-19
- DOI
- https://doi.org/10.61091/jcmcc124-39
- Primary Topic
- graph theory and CDMA systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00