On Distance Magic Harary Graphs
Combinatorics
2023-02-22 v1
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.
Cite
@article{arxiv.1809.07382,
title = {On Distance Magic Harary Graphs},
author = {A V Prajeesh and Krishnan Paramasivam},
journal= {arXiv preprint arXiv:1809.07382},
year = {2023}
}
Comments
12 pages, 1 figure