All trees are six-cordial

<p>For any integer $k&gt;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: <br />\beg...

Full description

Bibliographic Details
Main Authors: Keith Driscoll, Elliot Krop, Michelle Nguyen
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2017-04-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/231