Asha Rani, A (2020) Narayana Prime Cordial Labeling of Grid Graph. Fourth National Conference on Recent Trends in Mathematics, 2282 (1).

[thumbnail of Asha 2.pdf] Text
Asha 2.pdf - Published Version
Download (1MB)

Abstract

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.

Item Type: Article
Depositing User: Mr Team Mosys
Date Deposited: 17 Nov 2022 06:36
Last Modified: 17 Nov 2022 06:36
URI: http://ir.psgcas.ac.in/id/eprint/1635

Actions (login required)

View Item
View Item
Altmetric