English

Path-cordial abelian groups

Combinatorics 2022-03-25 v1

Abstract

A labeling of the vertices of a graph by elements of any abelian group AA induces a labeling of the edges by summing the labels of their endpoints. Hovey defined the graph GG to be AA-cordial if it has such a labeling where the vertex labels and the edge labels are both evenly-distributed over AA in a technical sense. His conjecture that all trees TT are AA-cordial for all cyclic groups AA 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 AA such that all path graphs are AA-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.

Keywords

Cite

@article{arxiv.2006.13764,
  title  = {Path-cordial abelian groups},
  author = {Rebecca Patrias and Oliver Pechenik},
  journal= {arXiv preprint arXiv:2006.13764},
  year   = {2022}
}

Comments

8 pages

R2 v1 2026-06-23T16:35:30.603Z