On Distance Magic Harary Graphs

Abstract

This paper establishes two techniques to construct larger distance magic and (a, d)-distance antimagic graphs using Harary graphs and provides a solution to the existence of distance magicness of G • C 4 and G × C 4 , for every non-regular distance magic graph G with maximum degree |V (G)| − 1.