An Overview of Neutrosophic Graphs

Nihar Ranjan Panda; Prasanta Kumar Raut; Amarendra Baral; Srikanta Kumar Sahoo; Sakya Singh Satapathy; Said Broumi

Authors

Nihar Ranjan Panda IMS & SUM Hospital, Siksha o Anusandhan Deemed to be University
Prasanta Kumar Raut Department of Mathematics, Trident Academy of Technology, Bhubaneswar, Odisha, India
Amarendra Baral Department of Mathematics, Trident Academy of Technology, Bhubaneswar, Odisha, India
Srikanta Kumar Sahoo National Institute of Technology, Agartala
Sakya Singh Satapathy
Said Broumi Laboratory of Information Processing, Faculty of Science Ben M’Sik, University Hassan II, Casablanca, Morocco

Keywords:

Decision-making problems; neutrosophic graph; uncertainty

Abstract

A new area of study called "neutrosophic graph theory" uses neutrosophic logic to expand on
traditional graph theory to include ambiguous, indeterminate, and uncertain information. This paper
gives a thorough introduction to neutrosophic graphs, including their definition, components, uses,
and difficulties. Neutrosophic graphs let you show and analyze relationships that aren't clear-cut
because they give vertices and edges different levels of truth, indeterminacy, and falsity. Image
processing, social network analysis, pattern recognition, and decision-making in the face of uncertainty
all use neutrosophic graphs. However, we still need to resolve issues like interpretability and
computational complexity. All things considered, neutrosophic graphs provide a viable framework for
representing and evaluating ambiguous information in graph structures, with potential applications
in a variety of fields.

DOI: 10.5281/zenodo.14176341