Abstract
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
, for
, as well as sunflower planar graph
for
, 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.