Path-cordial abelian groups
Rebecca Patrias, Oliver Pechenik

TL;DR
This paper explores the extension of Hovey's conjecture on $A$-cordial labelings from trees to all path graphs for finite abelian groups, providing partial characterizations and establishing results for specific group classes.
Contribution
It initiates the study of $A$-cordial labelings for path graphs over finite abelian groups beyond cyclic groups, proposing a conjecture and proving it for certain groups.
Findings
Conjecture characterizes groups where all path graphs are $A$-cordial.
Proved the conjecture for various infinite families of groups.
Confirmed the conjecture for all groups of small order.
Abstract
A labeling of the vertices of a graph by elements of any abelian group induces a labeling of the edges by summing the labels of their endpoints. Hovey defined the graph to be -cordial if it has such a labeling where the vertex labels and the edge labels are both evenly-distributed over in a technical sense. His conjecture that all trees are -cordial for all cyclic groups remains wide open, despite significant attention. Curiously, there has been very little study of whether Hovey's conjecture might extend beyond the class of cyclic groups. We initiate this study by analyzing the larger class of finite abelian groups such that all path graphs are -cordial. We conjecture a complete characterization of such groups, and establish this conjecture for various infinite families of groups as well as for all groups of small order.
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
