Distance Magic Index One Graphs
A V Prajeesh, Krishnan Paramasivam
TL;DR
This paper investigates the distance magic index of specific graph constructions, providing exact values and necessary conditions for regular graphs to have a distance magic index of one.
Contribution
It determines the distance magic index for complex graph products and establishes necessary conditions for regular graphs with index one.
Findings
Distance magic index of lexicograph product with complement of complete graph determined.
Distance magic index of disjoint unions of complete multipartite graphs analyzed.
Necessary conditions for regular graphs to have index one proved.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · graph theory and CDMA systems · Advanced Graph Theory Research