PRIME CORDIAL LABELING OF HEAWOOD GRAPH, PAPPUS GRAPH AND TUTTEβCOXETER GRAPH
J. Vasanthi, Ramya N Β· 2024
The prime cordial labeling of a graph is defined as π: π β {1,2,3, β¦ , |π|} which is a bijection such that the labels for every edge assigned to 1 if G.C.D (π(π’), π(π£)) = 1 and assigned to 0. if G.C.D (π(π’), π(π£)) > 1 then βππ π (0) -ππ π (1)β β€ 1.A prime cordial graphs are the one that allows for prime cordial labelings.This study examines whether the Heawood graph, Pappus graph and Tutte-Coxeter graphs allow for prime cordial labeling.