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 .
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.