NARAYANA PRIME CORDIAL LABELING OF SOME GRAPHS

  • Unique Paper ID: 197425
  • Volume: 12
  • Issue: 11
  • PageNo: 7360-7366
  • Abstract:
  • The labeling of graph is an assignment between the numbers and vertices/edges. In this paper, the results on the labeling of graph are studied using Narayana numbers and prime numbers for graphs namely; Crown, Triangular snake, Double Fan, Double Comb graphs.

Copyright & License

Copyright © 2026 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

BibTeX

@article{197425,
        author = {Lakshmi Janardhana R C},
        title = {NARAYANA PRIME CORDIAL LABELING OF SOME GRAPHS},
        journal = {International Journal of Innovative Research in Technology},
        year = {2026},
        volume = {12},
        number = {11},
        pages = {7360-7366},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=197425},
        abstract = {The labeling of graph is an assignment between the numbers and vertices/edges. In this paper, the results on the labeling of graph are studied using Narayana numbers and prime numbers for graphs namely; Crown, Triangular snake, Double Fan, Double Comb graphs.},
        keywords = {Graph, Tree, Narayana numbers, Prime cordial labeling. Crown, Triangular Lader Graphs},
        month = {April},
        }

Cite This Article

C, L. J. R. (2026). NARAYANA PRIME CORDIAL LABELING OF SOME GRAPHS. International Journal of Innovative Research in Technology (IJIRT), 12(11), 7360–7366.

Related Articles