REVISITING BI-STAR COMB MAGIC GRAPHOIDAL GRAPHS
S. Sriram*, R. Govindarajan · International Journal of Mathematical Archive · 2015
B.D.Acharya and E.Sampathkumar [1] defined Graphoidal cover as a partition of edge set of G into internally disjoint paths (not necessarily open). The minimum cardinality of such cover is known as graphoidal covering number of G.