W. Novitasari, Dafik, Slamin (2016-01-28)
Graph $G$ is a simple, finite and undirected graph. A graph
$G$ is called to be an $(a,d)-H$-antimagic total covering if there
is a bijective fuction $\lambda: V(G) \cup E(G) \rightarrow \{1,
2,\dots ,|V (G)| + |E(G)|\}$, ...