{"title":"Induced Acyclic Graphoidal Covers in a Graph","authors":"K. Ratan Singh, P. K. Das","country":null,"institution":"","volume":44,"journal":"International Journal of Mathematical and Computational Sciences","pagesStart":1078,"pagesEnd":1085,"ISSN":"1307-6892","URL":"https:\/\/publications.waset.org\/pdf\/11912","abstract":"An induced acyclic graphoidal cover of a graph G is a\r\ncollection \u03c8 of open paths in G such that every path in \u03c8 has atleast\r\ntwo vertices, every vertex of G is an internal vertex of at most one\r\npath in \u03c8, every edge of G is in exactly one path in \u03c8 and every\r\nmember of \u03c8 is an induced path. The minimum cardinality of an\r\ninduced acyclic graphoidal cover of G is called the induced acyclic\r\ngraphoidal covering number of G and is denoted by \u03b7ia(G) or \u03b7ia.\r\nHere we find induced acyclic graphoidal cover for some classes of\r\ngraphs.","references":null,"publisher":"World Academy of Science, Engineering and Technology","index":"Open Science Index 44, 2010"}