Path-cordial abelian groups

Abstract

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…