Graph labelling is an important tool in modelling real life problems. In the present paper, different graph families are studied for prime cordial labelling. In this work, we show that the double comb graph $P_n\odot 2K_1$, for $n\ge 2$, as well as sunflower planar graph $S{f}_n$ for $n\ge 3$, admit prime cordial labelling. We also prove that if we join two copies of sunflower planar graph by a path of arbitrary length then the resultant graph is also prime cordial.

中文翻译：

---

在某些主要亲和图族上

图形标记是对现实生活中的问题进行建模的重要工具。在本文中，对不同的图族进行了主要亲切标签的研究。在这项工作中，我们展示了双梳图$P_{ñ}\odot 2{ķ}_{\mathrm{1个}}$，对于 $ñ\ge 2$以及向日葵平面图 $\mathrm{小号}{F}_{ñ}$ 对于 $ñ\ge 3$，接受主要的亲切标签。我们还证明了，如果我们通过任意长度的路径将向日葵平面图的两个副本连接起来，那么结果图也将是质心图。