On the graph inequality \(\theta _{E}(G)\geqslant \theta _{E}(G^{m})\) (Q2495511)

Let \(\theta_E(G)\) denote the edge clique cover number of a graph \(G\). First of all, the authors give an example of a chordal graph satisfying \(\theta_E(G)<\theta_E(G^2)\), what was an open problem. They prove that \(\theta_E(G)\geq\theta_E(G^{2n+1})\) for any simple graph \(G\) and for each positive integer \(n\). Then they construct a graph not satisfying \(\theta_E(G)\geq\theta_E(G^{2n})\) for each positive integer \(n\). Moreover, the authors give a formula for \(\theta_E(T^n)\) for a tree \(T\) and also some open questions.