We applied triangulation in the cycle graphs C n , n ≥ 3 and generalized to n -transformation, also we observed that on splicing and folding introduced by Tom Head and E. El-Kholy & co. respectively in C 2m , m ≥ 2 and it's generalization leads to the resultant graph is 1 3 1 3 0 3 2 ..., , , , − n G G G P whereas on splicing and semigraph folding introduced by S. Jeyabharathi & Co. in C 2m-1 , m ≥ 2 and its generalization leads to the resultant semigraph with and an edge and one semi edge.