Distance Magic Index One Graphs
Combinatorics
2018-08-03 v1
Abstract
In this paper, we determine the distance magic index of lexicograph product of a regular graph with the complement of complete graph, disjoint union of m copies of complete multi- partite graph and disjoint union of m copies of lexicographic product of cycle with complement of complete graph. In addition to that, we also prove some necessary conditions for a regular graph to be of distance magic index one.
Cite
@article{arxiv.1808.00951,
title = {Distance Magic Index One Graphs},
author = {A V Prajeesh and Krishnan Paramasivam},
journal= {arXiv preprint arXiv:1808.00951},
year = {2018}
}
Comments
14pages