The edge corona of two graphs G and H, denoted by G 0 H, is obtained

by taking one copy of G and |E(G)| copies of H and joining each end vertices

of i-th edge of G to every vertex in the i-th copy of H. In this paper, the...