Notes On Group Distance Magicness of Product Graphs
A V Prajeesh, Krishnan Paramasivam
TL;DR
This paper investigates the properties of group distance magic labelings in product graphs, establishing necessary conditions and characterizations, especially for trees, to advance understanding of such labelings.
Contribution
It offers new results on group distance magic labelings for lexicographic and direct product graphs, including necessary conditions and a characterization for trees.
Findings
Derived necessary conditions for group distance magic graphs.
Characterized when trees are group distance magic.
Analyzed group distance magic properties in product graphs.
Abstract
In this paper, we provide few results on the group distance magic labeling of lexicographic product and direct product of two graphs. We also prove some necessary conditions for a graph to be group distance magic and provide a characterization for a tree to be group distance magic.
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.