… In this paper we deal with circulant graphs C n ( 1 , p ) . The … If a graph G admits a
distance magic labeling, then we say that G is a distance magic graph. …

… As mentioned we want to study distance magic circulants in this paper. We first recall the
definition. Let G be a finite group and let S be an inverse-closed subset of G, which does not …

… the distance magic circulants Ml m [ 2 K 1 ] , m ≥ 3 , Pr m [ 2 K 1 ] , m ≥ 3 odd, and C m [ 3
K 1 ] , m ≥ 3 odd or divisible by 4 , are trivial examples of 6 -valent distance magic circulants. …

… distance magic and antimagic labeling of circulant graphs. This is due to the fact that the …
distance antimagic circulant graphs with one generator in Section 2. We then circulant graphs …

… In this paper we study connected closed distance magic circulant graphs with valency at …
closed distance magic circulant graphs with valency 1 or 2 are the complete graphs K 2 and K 3 …

… distance magic graphs and some closely related graphs. A distance magic labeling of a graph
G with magic … As noted in Section 2.2, powers of graphs and circulant graphs can also be …

… A Γ -distance magic labeling of G is a bijection φ : V ⟶ Γ for … tetravalent circulant graphs which
admit a Γ -distance magic … all connected Γ -distance magic circulant graphs of valency four …

… One such concept is distance magic labeling which has been investigated under … magic
vertex labeling. In this paper we present a survey of existing results on distance magic graphs …

… We consider the closed distance magic graphs in the … the closed distance magic labelings
and the spectra of graphs. These … of graphs with complete graph or cycle and to the circulant …

… ◦ H is orientable Ztm-distance magic when H is a circulant of an even order m and G is of
order t. One can ask if G ◦ H is still orientable Ztm-distance magic if the circulant graph H is of an …