On D-distance (anti)magic labelings of shadow graph of some graphs

Let G be a graph with vertex set V(G) and diameter diam(G). Let D subset of {0, 1, 2, 3, ... , diam(G)} if > and phi : V (G) -> {1, 2, 3, ...,|V(G)|}be a bijection. The graph G is called D -distance magic, if Sigma(s is an element of ND(t)) phi(s) is a constant for any vertex t is an element of V(G). The graph G is called (alpha, beta)-D-distance antimagic, if {Sigma( s is an element of ND(t)) phi(s) : t is an element of V(G)} is a set {alpha, alpha + beta, alpha + 2 beta, ... , alpha + (|V(G)| - 1)beta}. In this paper, we study D -distance (anti)magic labelings of shadow graphs for D = {1}, {0, 1}, {2}, and {0, 2}.