A note on kk-cordial pp-uniform hypertrees

preprint2009arXivOpen access

Abstract

Hovey introduced a kk-cordial labeling of graphs as a generalization both of harmonious and cordial labelings. He proved that all tress are kk-cordial for k∈{1,...,5}k \in \{1,...,5\} and he conjectured that all trees are kk-cordial for all kk. \indent We consider a corresponding problem for hypergraphs, namely, we show that pp-uniform hypertrees are kk-cordial for certain values of kk.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.