Search

The definitions provided by the authors of the current study are offered together with a discussion of the recent advances that they have contributed. We begin with an introduction of the concepts of closed and open sets. We explore characteristics and provide an idea of obtained results by adding the notion of FNbϱNOS and analyzing a few of their properties in 𝑓𝑛𝑡𝑠. We've researched the contrasts between the derived, exterior, and frontier notions that are provided.

The study introduces a hybrid weighted similarity measure (HWSM) for the analysis of symptoms and diseases in patients using a neutrosophic set (NS). NS proves valuable for modeling uncertainty by accommodating contradictory and ambiguous information. The development of a similarity measure for NS information is crucial in various applications, particularly in medical diagnostics, to quantify similarity between sets. While existing literature provides various similarity measures for NS, only a limited number incorporates hybrid techniques. This study proposes a hybrid similarity measure that combines existing measures and integrates them with an entropy weight measure. To elaborate, distance- based similarity measures for NS are initially considered. Subsequently, an entropy weight measure is employed to calculate the attributes' weight of the attributes. The work includes formulating the properties of the proposed HWSM and its practical application in medical diagnosis, focusing on assessing the possibility of medical diagnoses in a patient. The study examines five symptoms which are fever, headache, stomach pain, cough, and chest pain. The HWSM is applied to analyze these symptoms across five different diseases, resulting in consistent and reliable outcomes. This research contributes to the ongoing enhancement of diagnostic tools for medical practitioners, addressing challenges associated with uncertainty in patient information.

Rough neutrosophic multisets (RNM) is an uncertainty set theory generalized from the rough neutrosophic set. In the same equivalence relation, the universal set is a neutrosophic multisets with boundary regions involving lower and upper approximation. To date, to handle the multiplicity of information collected, the rough neutrosophic multisets geometric aggregation operator (RNMGAO) is introduced. The algebraic operations of RNM used in the derivation of RNMGAO are defined. The entropy measure of RNM is also discussed as a weighted assign for each criterion simultaneously with the geometric aggregation operator. The roughness Dice similarity measure of RNM is combined in methodology for ranking purposed. The application in medical diagnosis of three epidemic diseases Coronavirus, Influenza, and Pneumonia is implemented as a case study.

Recently, the intelligent traffic control system and its uncertainty analysis are considered one of the hot spots for utilizing the available techniques. It became more essential when the automatic car, electric vehicle, and other smart cars have introduced the transportation. To control the traffic accident and smooth road services an intelligent traffic control system required. It will be also useful in decreasing the time, reaction time, and efficiency of traffic. However, the problem arises while characterization of true, false or uncertain regions of traffic flow and its future approximation. To deal with this issue some available mathematical technique for traffic flow using rough set, fuzzy rough set, and its extension with the neutrosophic set is discussed in this paper. Some of the papers related to graphical visualization of traffic flow is also discussed for further improvement. The rough set theory can be useful for dealing the uncertain, incomplete, and indeterminate data set. Hence, the hybridization of the neutrosophic set and rough can be considered one of the efficient tools for intelligent traffic control and its approximation via automatic red, green and yellow lights. This paper tried to provide an overview of each available technique to solve the traffic problem. It is hoped that the proposed study will be helpful for several researchers working on traffic flow, traffic accident diagnosis, and its hybridization as future research.

Distance measure is a numerical measurement of the distance between any two objects. The aim of this paper is to propose a new distance measure for trapezoidal fuzzy neutrosophic numbers based on the centroids with graphical representation. In addition, the metric properties of the proposed measure are examined in detail. A decision making problem also has been solved using the proposed distance measure for a software selection process. comparative analysis has been done with the existing methods to show the potential of the proposed distance measure and various forms of trapezoidal fuzzy neutrosophic number have been listed out to show the uniqueness of the proposed graphical representation. Further, advantages of the proposed distance measure have been given.

The concepts of cubic spherical neutrosophic sets (CSNSs), introduced and investigated by Gomathi et al. [5], offer a geometric representation of collection of neutrosophic sets (NSs), enhancing their ability to capture uncertainty. The formulation characterizes information using points on a sphere with a defined center and radius, providing a more precise depiction of fuzziness inherent in uncertain data. The cubic spherical neutrosophic Archimedean triangular norms(ATN) and conorms (ATCN), expanding the model's capabilities to handle uncertainty. These algebraic operators enable the aggregation and combination of uncertain information, offering a more comprehensive approach to decision-making. The research further presents a method for solving multiple-criteria decision-making problems within the cubic spherical neutrosophic context, leveraging the newly integrated norms and conorms. The algorithm utilizes the cosine similarity measure of cubic spherical neutrosophic sets, exemplified through an application involving the selection of the most effective electric truck. This extended framework provides decision-makers with enhanced tools to navigate complex decision landscapes amidst uncertainty, facilitating more informed and robust choices across diverse domains. [ABSTRACT FROM AUTHOR]

In classical graph theory, the minimal spanning tree (MST) is a subgraph that lacks cycles and efficiently connects every vertex by utilizing edges with the minimum weights. The computation of a minimum spanning tree for a graph has been a pervasive problem over time. However, in practical scenarios, uncertainty often arises in the form of fuzzy edge weights, leading to the emergence of the Fuzzy Minimum Spanning Tree (FMST). This specialized approach is adept at managing the inherent uncertainty present in edge weights within a fuzzy graph, a situation commonly encountered in real-world applications. This study introduces the initial optimization approach for the Minimum Spanning Tree Problem within the context of interval-valued fermatean neutrosophic domain. The proposed solution involves the adaptation of the Dhouib-Matrix-MSTP (DM-MSTP) method, an innovative technique designed for optimal resolution. The DM-MSTP method operates by employing a column-row navigation strategy through the adjacency matrix. To the best of our knowledge, instances of this specific problem have not been addressed previously. To address this gap, a case study is generated, providing a comprehensive application of the novel DM-MSTP method with detailed insights into its functionality and efficacy. [ABSTRACT FROM AUTHOR]

A neutrosophic set is a mathematical framework that extends fuzzy and intuitionistic sets to handle indeterminate or contradictory information using three components: truth, falsity, and indeterminacy -membership degrees which deal with handling indeterminate, imprecise, and uncertain data, while Extended Fuzzy Theory extends the standard fuzzy set theory to manage more intricate membership degrees. The primary objective of this review is to thoroughly investigate and summarize the existing literature on trapezoidal neutrosophic environments, particularly focusing on aspects such as the NFMOLP Problems in SVTpN environments. Ultimately, this comprehensive review article aims to enhance the understanding of the potential of these integrated methodologies for effectively presenting decision-making amidst complex and uncertain conditions. [ABSTRACT FROM AUTHOR]

Graph theory plays a vital role in modeling real-world scenarios like network security and expert systems. Various extensions of graph theoretical conceptions have been designed for addressing uncertainty in graphical network scenarios. The concept of Fermatean Neutrosophic Dombi Fuzzy Graphs (FNDFgraphs) represents a novel and innovative extension in graph theory, combining the principles of Fermatean Neutrosophic fuzzy graphs and the Dombi operator. FNDFGs enhances the representation and analysis of uncertain rela- tionships in a graph also it offers a more comprehensive and exible approach to modeling uncertainty in graph structures. The main objective of this present research study focused on FNDFGs and their operations. At the end, an algorithm for Fermatean Neutrosophic Dombi fuzzy multi-criteria decision-making is given, which incorporate the concepts of Fermatean Neutrosophic sets and Dombi operations. Furthermore, a numerical example based on the selection of the most suitable CIBIL score application is put forward to illuminate the aptness of the proposed research work. [ABSTRACT FROM AUTHOR]

In The traveling salesman problem (TSP) is an essential and the most popular conventional combinatorial optimization network problem in operations research, in which the TSP evaluates the shortest route or path in a network. In TSP, every node has been visited only once, excluding the starting node. In TSP, edge lengths are usually expressed to indicate journey time and expenses instead of distance from a location. The exact arc length can't be predicted because journey times and expenses vary depending on the amount of payload, climate, highway conditions, and so on. As a result, the Neutrosophic numbers introduce a new tool for dealing with unpredictability in TSP. The present article addresses TSP on a neutrosophic network where the edge weight is a neutrosophic number rather than a real number. For solving the Neutrosophic TSP, an algorithmic technique based on the genetic algorithm (GA) is proposed. We created a new mutation and crossover for our suggested GA. We used mathematical examples to show the usefulness of the algorithm that we suggested. The results of experiments suggest that the proposed GA can find the shortest path in a TSP within a neutrosophic framework. This provides valuable insights for decision-makers dealing with real-world situations characterized by imprecise and incomplete data. [ABSTRACT FROM AUTHOR]