A STUDY ON NEUTROSOPHIC CORDIAL LABELING GRAPHS WITH ALGORITHM

Authors

  • Ragavi M Department of Mathematics, Alagappa University,Karaikudi, Tamilnadu, India
  • Kannan T Department of Mathematics, Alagappa University,Karaikudi, Tamilnadu, India

DOI:

https://doi.org/10.19139/soic-2310-5070-2953

Keywords:

Fuzzy Cordial Labeling Graphs (FCLG), Intuitionstic Cordial Labeling Graphs (ICLG), Neutrosophic Cordial Labeling Graphs (NCLG)

Abstract

We present here the neutrosophic cordial labeling graphs, which integrate neutrosophic and cordial labeling graphs. This work explores three types of graph labeling such as fuzzy cordial labeling graphs, intuitionistic fuzzy cordial labeling graphs and neutrosophic cordial labeling graphs. We provide some functions for vertex and edge labeling under specific conditions, such that if the edge labeling is less than 0.5, the cordial labeling is 0 and 1; otherwise, indicating the integral part of that edge labeling. Furthermore, it meets the cordial labeling requirement, which states that the number of edges labeled with 0 and 1 differ at most by 1.

Downloads

Published

2025-11-04

How to Cite

M, R., & T, K. (2025). A STUDY ON NEUTROSOPHIC CORDIAL LABELING GRAPHS WITH ALGORITHM. Statistics, Optimization & Information Computing, 15(4), 2638–2645. https://doi.org/10.19139/soic-2310-5070-2953

Issue

Section

Research Articles