All Trees are Seven-Cordial

Abstract

For any integer $k>0$, a tree $T$ is $k$-cordial if there exists a labeling of the vertices of $T$ by ${\mathbb{Z}}_k$, inducing edge-weights as the sum modulo $k$ of the labels on incident vertices to a given edge, which furthermore satisfies the following conditions: (i) Each label appears on at most one more vertex than any other label. (ii) Each edge-weight appears on at most one more edge than any other edge-weight. Mark Hovey (1991) conjectured that all trees are $k$-cordial for any integer $k$. Cahit (1987) had shown earlier that all trees are $2$-cordial and Hovey proved that all trees are $3,4,$ and $5$-cordial. Driscoll, et. al. (2017), used an adjustment to Hovey's test to show that all trees are $6$-cordial. It is shown here that all trees are $7$-cordial by that same adjustment.

20 pages, 24 figures. arXiv admin note: substantial text overlap with arXiv:1604.02105

Cited by in corpus (1)

• Path-cordial abelian groups