A note on distance magic index of partite graphs
Eshwar Srinivasan, A V Prajeesh, and Krishnan Paramasivam
TL;DR
This paper investigates the distance magic index of specific classes of partite graphs, providing new insights into their labeling properties.
Contribution
It determines the distance magic index for important classes of partite graphs, advancing understanding of their structural labeling characteristics.
Findings
Distance magic index values for certain partite graphs are established.
New theoretical results on graph labeling are presented.
The study enhances knowledge of graph labeling in partite graphs.
Abstract
In this article, the distance magic index of certain important classes of partite graphs are determined.
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 applications