%0 Journal Article %A K. Ratan Singh and P. K. Das %D 2010 %J International Journal of Mathematical and Computational Sciences %B World Academy of Science, Engineering and Technology %I Open Science Index 44, 2010 %T Induced Acyclic Graphoidal Covers in a Graph %U https://publications.waset.org/pdf/11912 %V 44 %X An induced acyclic graphoidal cover of a graph G is a collection ψ of open paths in G such that every path in ψ has atleast two vertices, every vertex of G is an internal vertex of at most one path in ψ, every edge of G is in exactly one path in ψ and every member of ψ is an induced path. The minimum cardinality of an induced acyclic graphoidal cover of G is called the induced acyclic graphoidal covering number of G and is denoted by ηia(G) or ηia. Here we find induced acyclic graphoidal cover for some classes of graphs. %P 1078 - 1084