A STUDY ON NEUTROSOPHIC CORDIAL LABELING GRAPHS WITH ALGORITHM
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.
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. https://doi.org/10.19139/soic-2310-5070-2953
Issue
Section
Research Articles
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).