加载中…
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 .

生成讲解博客的中文版本

生成AI智能校验的中文版本