A note on $k$-cordial $p$-uniform hypertrees
Combinatorics
2012-04-05 v1
Abstract
Hovey introduced a -cordial labeling of graphs as a generalization both of harmonious and cordial labelings. He proved that all tress are -cordial for and he conjectured that all trees are -cordial for all . \indent We consider a corresponding problem for hypergraphs, namely, we show that -uniform hypertrees are -cordial for certain values of .
Cite
@article{arxiv.0910.2344,
title = {A note on $k$-cordial $p$-uniform hypertrees},
author = {Sylwia Cichacz and Agnieszka Goerlich},
journal= {arXiv preprint arXiv:0910.2344},
year = {2012}
}