Decomposition of Corona Graph

Abstract

Let G = (V, E) be a finite and connected graph. The corona Gm ⊙Gn of two graphs Gm and Gn is defined as the graph created by taking one copy of Gm and |V(Gm)| copies of Gn and attaching the i th vertex of Gm to every vertex in the i th copy of Gn. In this paper, we initiate the decomposition of the corona Gm ⊙ Gn into cycles, paths, and claws of varying lengths.