<i>Supereulerian Digraph</i>Strong Products

A vertex cycle cover of a digraph H is a collection C = {C1, C2, …, Ck} of directed cycles in H such that these directed cycles together cover all vertices in H and such that the arc sets of these directed cycles induce a connected subdigraph of H. A subdigraph F of a digraph D is a circulation if for every vertex in F, the indegree of v equals its out degree, and a spanning circulation if F is a cycle factor. Define f (D) to be the smallest cardinality of a vertex cycle cover of the digraph obtained from D by contracting all arcs in F, among all circulations F of D. Adigraph D is supereulerian if D has a spanning connected circulation. In [International Journal of Engineering Science Invention, 8 (2019) 12-19], it is proved that if D1 and D2 are nontrivial strong digraphs such that D1 is supereulerian and D2 has a cycle vertex cover C’ with |C’| ≤ |V (D1)|, then the Cartesian product D1 and D2 is also supereulerian. In this paper, we prove that for strong digraphs D1 and D2, if for some cycle factor F1 of D1, the digraph formed from D1 by contracting arcs in F1 is hamiltonian with f (D2) not bigger than |V (D1)|, then the strong product D1 and D2 is supereulerian.