Path Double Covering Number of Product Graphs

A path partition or a path cover of a graph G is a collection P of paths in G such that every edge of G is in exactly one path in P. Various types of path covers such as Smarandache path k-cover, simple path covers have been studied by several authors by imposing conditions on the paths in the path covers. In this paper, We study the minimum number of paths which cover a graph such that each edge of the graph occurs exactly twice in two(distinct) paths