A graphoidal cover of G is a set ψ 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 ψ and every edge of G is in exactly one path in ψ. The minimum cardinality of a graphoidal cover of G is called the graphoidal covering number of G and is denoted by η. If every two paths in ψ have at most one common vertex, then it is called a simple graphoidal cover of G. The minimum cardinality of a simple graphoidal cover of G is called a simple graphoidal covering number of G and is denoted by η_s. Here we determine the η_s on tensor product of graphs.

graphoidal covers, simple graphoidal covers, tensor product of graphs.