PRIME CORDIAL LABELING OF HEAWOOD GRAPH, PAPPUS GRAPH AND TUTTE–COXETER GRAPH
J. Vasanthi1, N. Ramya2
1Research Scholar, 2Professor
Department of Mathematics
Bharath Institute of Higher Education & Research, Chennai, Tamil Nadu, India
Abstract: The prime cordial labeling of a graph is defined as f: V→{1,2,3,…,|V|} which is a bijection such that the labels for every edge assigned to 1 if G.C.D (f(u), f(v))=1 and assigned to 0. if G.C.D (f(u), f(v))>1 then │〖ee〗_f (0)-〖ee〗_f (1)│≤1. A prime cordial graphs are the one that allows for prime cordial labeling. This study examines whether the Heawood graph, Pappus graph and Tutte-Coxeter graphs allow for prime cordial labeling.
Keywords: Heawood graph, Pappus graph, Tutte-Coxeter graphs, prime cordial labeling