… A graph is said to be distance magic if it admits a distance magic labeling. In this paper we
classify all connected tetravalent distance magic circulants, that is Cayley graphs Cay ( Z n ; S …

… we deal with circulant graphs C n ( 1 , p ) . The circulant graph C n ( 1 , p ) is the graph on
the … We completely characterize distance magic graphs C n ( 1 , p ) for p odd. We also give …

… 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 …

… 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 …

… 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 …

… 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 …

… ◦ 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 …

… Among regular graphs, we investigate the case of a circulant graph. … Let G be a distance
magic graph of order n with labeling f and magic constant k. For the complement G of …

… A graph G is said to be D-distance magic if all vertices has … ] and constructions of distance
magic graphs have also been … subgraph characterization for distance magic graph [23, 1, 18]. …

… integer μ (called the magic constant) such that ∑ y ∈ N G ( x ) l ( y ) = μ for every x ∈ V .
If a graph G admits a distance magic labeling, then we say that G is a distance magic graph [4]. …