Power domination number of the middle graph

Let $G$ be any graph, and let $M(G)$ denote its middle graph. Write $\gamma_p(M(G))$ for the power domination number of $M(G)$ and $\gamma^{'}(G)$ for the edge domination number of $G$. Power domination–edge domination conjecture. For any graph $G$,

$$\gamma_p(M(G)) = \gamma^{'}(G).$$

This is presented as an open problem concerning the relationship between power domination in middle graphs and edge domination in the original graph.