A simple graph is called cordial if it has 0-1 labeling that satisfies certain conditions. In this paper, we examine the necessary and sufficient conditions for cordial labeling of the sum and union of two fourth power of paths and cycles.

中文翻译：

---

路径和循环的四次方和的和与并的诚意

如果简单图形具有满足特定条件的0-1标签，则称为“亲和图”。在本文中，我们研究了亲切标记路径和循环的四次方和的总和的必要和充分条件。