The direct product of graphs G=(V(G),E(G)) and H=(V(H),E(H)) is the
graph, denoted as GΓH, with vertex set V(GΓH)=V(G)ΓV(H),
where vertices (x1β,y1β) and (x2β,y2β) are adjacent in GΓH if
x1βx2ββE(G) and y1βy2ββE(H). The edge connectivity of a graph G,
denoted as Ξ»(G), is the size of a minimum edge-cut in G. We introduce
a function Ο and prove the following formula %for the edge-connectivity of
direct products Ξ»(GΓH)=min2Ξ»(G)β£E(H)β£,2Ξ»(H)β£E(G)β£,Ξ΄(GΓH),Ο(G,H),Ο(H,G). We also describe the structure of every minimum edge-cut in GΓH