The decomposition of graphs is one of the prominent areas of research in graph theory. The circular ladder graphs are denoted as \(CL_{n}\) and the circular ladder graph can be obtained as \(CL_{n} = C_{n}\times P_{2}\) , where \(C_{n}\) is a cycle graph of length n and \(P_{2}\) is a path graph of length one. This paper introduces the edge decomposition of circular ladder graph with 2n vertices and 3n edges. In the main results, a recursive decomposition of the circular ladder graph into claws, cycles, and paths are given.
