Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Decomposition of the cartesian product of complete graphs into paths and cycles of length six

A. Pauline Ezhilarasi1, A. Muthusamy2
1Department of Mathematics, Jeppiaar Engineering College, Chennai-600119, India
2Department of Mathematics, Periyar University, Salem-636011, India
  • Accepted: 04/06/2020
  • Published Online: 19/03/2025

Abstract

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.

Keywords: graph decomposition, path, cycle and product graph
Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
A. Pauline Ezhilarasi, A. Muthusamy. Decomposition of the cartesian product of complete graphs into paths and cycles of length six[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 124. 581-600. https://doi.org/10.61091/jcmcc124-39.