Competition hypergraphs of products of digraphs (Q844216)

For the digraph \(D=(V,A)\) the edges of its \textit{competition graph} single out the pair of vertices with common out-neighbors. In a food-web they are the predators with common prey. In general a competition graph does not contain enough information to reconstruct the original digraph. The hyper edges of the \textit{competition hypergraph} (CH for short) consist of the in-neighborhoods of the vertices of the digraph. (The sets of predators with common prey form the hyper edges.) Since different preys may have the same set of predators, the reconstruction of the digraph from its CH is not always possible. The main problem of this paper is whether the CHs of two digraphs can be derived from the CH of their digraph products, and vice versa (where the possible product types are drawn from a five element list).