A finite simple undirected graph containing p vertices and q edges is called as prime anti-magic if it has an injection from the vertex set of integers {1, 2, . . . , p} satisfying that for each edge uv, the labels given ...