Narayana prime cordial labeling of grid graph

Narayana prime cordial labeling of grid graph

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Rani, A. Asha, Thirusangu, K., Balamurugan, B. J., Manonmani, A.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Graph theory
Labeling
Labelling
Scientific papers
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0094-243X
1551-7616
DOI:10.1063/5.0028719