Decomposition of cartesian product of complete graphs into sunlet graphs of order eight

Authors

  • Sowndhariya Kaliappan Department of Mathematics, Periyar University, Salem, Tamil Nadu, India
  • Appu Muthusamy Department of Mathematics, Periyar University, Salem, Tamil Nadu, India https://orcid.org/0000-0001-9014-6916

DOI:

https://doi.org/10.13069/jacodesmath.1056547

Keywords:

Graph decomposition, Cartesian product, Corona graph, Sunlet graph

Abstract

For any integer $k\geq 3$, we define the sunlet graph of order 2k, denoted by $L_{2k}$, as the graph consisting of a cycle of length k together with k pendant vertices such that, each pendant vertex adjacent to exactly one vertex of the cycle so that the degree of each vertex in the cycle is 3. In this paper, we establish necessary and sufficient conditions for the existence of decomposition of the Cartesian product of complete graphs into sunlet graphs of order eight.

Received: 24 January 2021 | Accepted: 25 November 2021

Downloads

Download data is not yet available.

Downloads

Published

2022-01-13

How to Cite

Kaliappan, S., & Muthusamy, A. (2022). Decomposition of cartesian product of complete graphs into sunlet graphs of order eight. Journal of Algebra Combinatorics Discrete Structures and Applications, 9(1), 29–46. https://doi.org/10.13069/jacodesmath.1056547

Issue

Section

Articles