Narayana prime cordial labeling of grid graph
A. Asha Rani, K. Thirusangu, Bommahalli Jayaraman Balamurugan, A. Manonmani · AIP conference proceedings · 2020
Let G = (V, E) be a graph. The binary numbers 0 and 1 have been allotted to the edges of the graph G through the evaluating functions defined on V and E by ensuring the cordiality conditions. This has been obtained through the prime and the Narayana numbers. Any graph G which admits this labeling is known as Narayanaprime cordial graph. In this research paper , we compute the Narayana prime cordial labeling of Grid graphs.