@article{(Open Science Index):https://publications.waset.org/pdf/10283, title = {Induced Graphoidal Covers in a Graph}, author = {K. Ratan Singh and P. K. Das}, country = {}, institution = {}, abstract = {An induced graphoidal cover of a graph G is a collection ψ of (not necessarily open) paths in G such that every path in ψ has at least 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 cycle or an induced path. The minimum cardinality of an induced graphoidal cover of G is called the induced graphoidal covering number of G and is denoted by ηi(G) or ηi. Here we find induced graphoidal cover for some classes of graphs. }, journal = {International Journal of Mathematical and Computational Sciences}, volume = {4}, number = {8}, year = {2010}, pages = {1073 - 1077}, ee = {https://publications.waset.org/pdf/10283}, url = {https://publications.waset.org/vol/44}, bibsource = {https://publications.waset.org/}, issn = {eISSN: 1307-6892}, publisher = {World Academy of Science, Engineering and Technology}, index = {Open Science Index 44, 2010}, }