On certain prime cordial families of graphs

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 ${P_n} \odot 2{K_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.

Keywords

• double comb graph
• sunflower graph
• cordial labelling
• prime cordial labelling