A graph Γ=(V,E) of order n is distance magic if it admits a bijective labeling ℓ:V→{1,2,…,n} its vertices for which there exists positive integer κ such that ∑u∈N(v)ℓ(u)=κ all v∈V, where N(v) the neighborhood v. circulant admitting an automorphism cyclically permuting vertices. In this paper we study circulants valency 6. We obtain some necessary and sufficient conditions 6 to be magic, thereby...
