A. Nellai Murugan, Magic Graphoidal on Class of Trees, BMSA Volume 9, Bulletin of Mathematical Sciences and Applications (Volume 9)
https://www.scipress.com/BMSA.9.33
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.
Keywords:
    Graphoidal Constant, Graphoidal Cover, Magic Graphoidal