We give an exact formula for the fractional distance-edge-monitoring number of $G\circ H$, where $G$ is connected of order $m\ge2$ and $H$ has order $n\ge2$. By the previously established endpoint-monitoring property, the fractional monitoring program reduces to fractional vertex cover, whose linear-programming dual is fractional matching. Writing $d_c(H)$ for the critical difference of $H$, we obtain $\operatorname{dem}_{f}(G\circ H)=(mn-D(G,H))/2$, where $D(G,H)=\max_{A\in\mathcal{I}(G)}\bigl(d_c(H)|A|-n|N_G(A)|\bigr)$ and $\mathcal{I}(G)$ denotes the family of all independent sets of $G$, including the empty set, while $N_G(A)$ is the open neighborhood of $A$. This formula characterizes the products attaining $mn/2$ and gives an equality criterion for the fractional matching lower bound of Ma, Cheng, Mao and Wang. Under the stated hypotheses, the lower bound of Ma et al. is attained if and only if either factor has a fractional perfect matching or $H$ is edgeless. Two outer trees show that the factor orders and fractional matching numbers do not determine the product value.

翻译：暂无翻译