Year: 2018
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Prajeesh, A V, Paramasivam, Krishnan
Institution: National Institute of Technology Calicut
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2890188472