Distance Magic Index One Graphs
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.