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 ith vertex of Gm to every vertex in the ith copy of Gn. In this paper, we initiate to decompose the corona Gn ? Gm into cycles, paths, and claws of varying lengths.
Pegu et al. (Wed,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: