Continuous monotonic decomposition of corona product Cn⊙ Km¯.

Let G be a simple graph with an edge set E(G). If G₁, G₂, G₃, ... , G_r are connected edge disjoint subgraphs of G with E(G) = E(G₁) ∪ E(G₂) ∪ E(G₃) ∪ ... ∪ E(G_r), then G₁, G₂, G₃, ... , G_r is a decomposition of G. An (a, d) − Continuous Monotonic Decompositions, or (a, d) − CMD, of G is a decomposition of G into r subgraphs G₁, G₂, G₃, ... , G_r such that every G_i is connected and |E(G_i)| = a + (i − 1)d, for every i = 1, 2, 3,.. , r. Many authors have studied decomposition, including (a, d) − CMD, of graphs. In this paper we study (a, d) − CMD of some other class of graphs. Let n and m be positive integers, n ≥ 3. The corona product of a cycle C_n and an empty graph K m ¯ , denoted C n ⊙ K m ¯ , is a graph formed from C_n and n copies of K m ¯ by joining each ith vertex of C_n, with an edge, to every vertex of the ith copy of K m ¯. A caterpillar is a tree in which the removal of all its end vertices results a path. In this paper we find an (a, d) − CMD of C n ⊙ K m ¯ into caterpillars. [ABSTRACT FROM AUTHOR]