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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call