• G. Susi Vinnarasi
• V.Maheswari
• K. Bala Deepa Arasi

The concept of graphoidal cover was introduced by B.D. Acharya and E. SampathKumar [1]. The concept of 2-graphoidal path cover was introduced by K.Nagarajan [7] et.al,. The concept of 3-graphoidal cover was introduced by T.Gayathri [4] et.al., A 3-graphoidal path cover of a graph G is a collection of paths in G such that every path in G has at least two vertices, every vertex of G is an internal vertex of at most three paths and every edge of G is in exactly one path. The minimum cardinality of it is a 3-graphoidal path covering number _3a(G). In this paper we find_3a(G) for some special graphs.

Graphoidal cover, Acyclic graphoidal, 2-Graphoidal cover and 3-Graphoidal cover.

"3 – GRAPHOIDAL PATH COVERS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 2, page no.940-945, February-2019, Available :http://www.jetir.org/papers/JETIRAB06177.pdf

"3 – GRAPHOIDAL PATH COVERS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 2, page no. pp940-945, February-2019, Available at : http://www.jetir.org/papers/JETIRAB06177.pdf