Decomposition of Cartesian Product of Complete Graphs into Sunlet Graphs of Order Eight

2019/07/29 by Sowndhariya, K., Muthusamy, A. · 1 citation
#05C51 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1907.12329

Abstract

we define the sunlet graph is the graph obtained by taking one copy of the cycle and joined every vertex of the cycle to an exactly one pendant vertex such that the degree of each vertex in the cycle is three. In this paper, we establish necessary and sufficient conditions for the existence of decomposition of the Cartesian product of complete graphs into sunlet graph of order eight.

Cited by

• Sunlet factors for Cartesian products of cycles

Related

• Sunlet factors for Cartesian products of cycles
• Decompositions of some classes of regular graphs into cycles and paths of length eight
• Decomposition of hypercubes into sunlet graphs
• Cycle decompositions of cartesian products of two cycles
• On the Crossing Number of the Cartesian Product of a Sunlet Graph and a Star Graph