K. Ratan Singh and P. K. Das
Induced Acyclic Graphoidal Covers in a Graph
1078 - 1084
2010
4
8
International Journal of Mathematical and Computational Sciences
https://publications.waset.org/pdf/11912
https://publications.waset.org/vol/44
World Academy of Science, Engineering and Technology
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.
Open Science Index 44, 2010