Sunlet decomposition of tensor product graphs

Abstract

For any integer r ≥ 3, the sunlet graph of order 2 r is a graph consisting of a cycle of length r with each vertex of the cycle adjacent to a pendant vertex. In this present article, we shall obtain the necessary and sufficient conditions for decomposing the tensor product of complete graphs and complete graph minus a 1-factor with complete graph K m (that is, K n × K m and K n − I × K m respectively) into sunlet graphs.