Path Decomposition of Restricted Super Line Graph of Cycle Graph

Abstract

A decomposition of a graph G is a collection  of graphs of G such that every edge of G belongs to exactly one of . If each  is a path, then  is called the path decomposition of G. In this paper, we discussed the path decomposition of the restricted super line graph of index 2 of G when G is isomorphic to the Cycle graph