Magic Graphoidal on Class of Trees

Abstract

B.D.Acharya and E. Sampathkumar (1) defined Graphoidal cover as partition of edge set of a graph G into internally disjoint paths (not necessarily open). The minimum cardinality of such cover is known as graphoidal covering number of G.