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 legicographic product and direct product of G with C4, for every non-regular distance magic graph G with maximum degree |V(G)|-1.

12 pages, 1 figure

References in corpus (2)

• Distance magic labeling and two products of graphs
• On Distance Antimagic Graphs