Distance Magic Index One Graphs
From MaRDI portal
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.
This page was built for publication: Distance Magic Index One Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6304961)
