Search Results (9)

Graph theory models relationships by representing entities as vertices and their interactionsas edges. To handle directionality and multiple head–tail assignments, various extensions—directed, bidirected, and multidirected graphs—have been introduced, with the multidirected graph unifying the first two. In this work, we further enrich this landscape by proposing the Multidirected hypergraph, which merges the flexibility of hypergraphs and superhypergraphs to describe higher-order and hierarchical connections. Building on this, we introduce five uncertainty-aware Multidirected frameworks—fuzzy, neutrosophic, plithogenic, rough, and soft multidirected graphs—by embedding classical uncertainty models into the Multidirected setting. We outline their formal definitions, examine key structural properties, and illustrate each with examples, thereby laying groundwork for future advances in uncertain graph analysis and decision-making. Full article

In this article, we have proposed a multi-attribute group decision making (MAGDM) with a new scenario or new condition named Chaotic MAGDM, in which not only the weights of the decision makers (DMs) and the weights of the decision attributes are considered, but also the familiarity of the DMs with the attributes are considered. Then we applied the weighted neutrosophic fuzzy soft rough set theory to Chaotic MAGDM and proposed a new algorithm for MAGDM. Moreover, we provide a case study to demonstrate the application of the algorithm. Our contributions to the literature are as follows: (1) familiarity is rubbed into MAGDM for the first time in the context of neutrosophic fuzzy soft rough sets; (2) a new MAGDM model based on neutrosophic fuzzy soft rough sets has been designed; (3) a sorting/ranking algorithm based on a neutrosophic fuzzy soft rough set is constructed. Full article

Many of the new $MV$-valued fuzzy structures, including intuitionistic, neutrosophic, or fuzzy soft sets, can be transformed into so-called almost $MV$-valued fuzzy sets, or, equivalently, fuzzy sets with values in dual pair of semirings (in symbols, $(\mathcal{R},{\mathcal{R}}^{*})$-fuzzy sets). This transformation allows any construction of almost $MV$-valued fuzzy sets to be retransformed into an analogous construction for these new fuzzy structures. In that way, approximation theories for $(\mathcal{R},{\mathcal{R}}^{*})$-fuzzy sets, rough $(\mathcal{R},{\mathcal{R}}^{*})$-fuzzy sets theories, or F-transform theories for $(\mathcal{R},{\mathcal{R}}^{*})$-fuzzy sets have already been created and then retransformed for these new fuzzy structures. In this paper, we continue this trend and define, on the one hand, the theory of extensional $(\mathcal{R},{\mathcal{R}}^{*})$-fuzzy sets defined on sets with fuzzy similarity relations with values in dual pair of semirings and power sets functors related to this theory and, at the same time, the theory of cuts with relational morphisms of these structures. Illustratively, the reverse transformations of some of these concepts into new fuzzy structures are presented. Full article

Many of the new fuzzy structures with complete $MV$-algebras as value sets, such as hesitant, intuitionistic, neutrosophic, or fuzzy soft sets, can be transformed into one type of fuzzy set with values in special complete algebras, called $AMV$-algebras. The category of complete $AMV$-algebras is isomorphic to the category of special pairs $(\mathcal{R},{\mathcal{R}}^{\ast })$ of complete commutative semirings and the corresponding fuzzy sets are called $(\mathcal{R},{\mathcal{R}}^{\ast })$-fuzzy sets. We use this theory to define $(\mathcal{R},{\mathcal{R}}^{\ast })$-fuzzy relations, lower and upper approximations of $(\mathcal{R},{\mathcal{R}}^{\ast })$-fuzzy sets by $(\mathcal{R},{\mathcal{R}}^{\ast })$-relations, and rough $(\mathcal{R},{\mathcal{R}}^{\ast })$-fuzzy sets, and we show that these notions can be universally applied to any fuzzy type structure that is transformable to $(\mathcal{R},{\mathcal{R}}^{\ast })$-fuzzy sets. As an example, we also show how this general theory can be used to determine the upper and lower approximations of a color segment corresponding to a particular color. Full article

Modeling uncertainties with spherical linear Diophantine fuzzy sets (SLDFSs) is a robust approach towards engineering, information management, medicine, multi-criteria decision-making (MCDM) applications. The existing concepts of neutrosophic sets (NSs), picture fuzzy sets (PFSs), and spherical fuzzy sets (SFSs) are strong models for MCDM. Nevertheless, these models have certain limitations for three indexes, satisfaction (membership), dissatisfaction (non-membership), refusal/abstain (indeterminacy) grades. A SLDFS with the use of reference parameters becomes an advanced approach to deal with uncertainties in MCDM and to remove strict limitations of above grades. In this approach the decision makers (DMs) have the freedom for the selection of above three indexes in $[0,1]$. The addition of reference parameters with three index/grades is a more effective approach to analyze DMs opinion. We discuss the concept of spherical linear Diophantine fuzzy numbers (SLDFNs) and certain properties of SLDFSs and SLDFNs. These concepts are illustrated by examples and graphical representation. Some score functions for comparison of LDFNs are developed. We introduce the novel concepts of spherical linear Diophantine fuzzy soft rough set (SLDFSRS) and spherical linear Diophantine fuzzy soft approximation space. The proposed model of SLDFSRS is a robust hybrid model of SLDFS, soft set, and rough set. We develop new algorithms for MCDM of suitable clean energy technology. We use the concepts of score functions, reduct, and core for the optimal decision. A brief comparative analysis of the proposed approach with some existing techniques is established to indicate the validity, flexibility, and superiority of the suggested MCDM approach. Full article

To handle indeterminate and incomplete data, neutrosophic logic/set/probability were established. The neutrosophic truth, falsehood and indeterminacy components exhibit symmetry as the truth and the falsehood look the same and behave in a symmetrical way with respect to the indeterminacy component which serves as a line of the symmetry. Soft set is a generic mathematical tool for dealing with uncertainty. Rough set is a new mathematical tool for dealing with vague, imprecise, inconsistent and uncertain knowledge in information systems. This paper introduces a new rough set model based on neutrosophic soft set to exploit simultaneously the advantages of rough sets and neutrosophic soft sets in order to handle all types of uncertainty in data. The idea of neutrosophic right neighborhood is utilised to define the concepts of neutrosophic soft rough (NSR) lower and upper approximations. Properties of suggested approximations are proposed and subsequently proven. Some of the NSR set concepts such as NSR-definability, NSR-relations and NSR-membership functions are suggested and illustrated with examples. Further, we demonstrate the feasibility of the newly rough set model with decision making problems involving neutrosophic soft set. Finally, a discussion on the features and limitations of the proposed model is provided. Full article

In this paper, we apply the notion of soft rough neutrosophic sets to graph theory. We develop certain new concepts, including soft rough neutrosophic graphs, soft rough neutrosophic influence graphs, soft rough neutrosophic influence cycles and soft rough neutrosophic influence trees. We illustrate these concepts with examples, and investigate some of their properties. We solve the decision-making problem by using our proposed algorithm. Full article

Soft sets (SSs), neutrosophic sets (NSs), and rough sets (RSs) are different mathematical models for handling uncertainties, but they are mutually related. In this research paper, we introduce the notions of soft rough neutrosophic sets (SRNSs) and neutrosophic soft rough sets (NSRSs) as hybrid models for soft computing. We describe a mathematical approach to handle decision-making problems in view of NSRSs. We also present an efficient algorithm of our proposed hybrid model to solve decision-making problems. Full article

Neutrosophic sets (NSs) handle uncertain information while fuzzy sets (FSs) and intuitionistic fuzzy sets (IFs) fail to handle indeterminate information. Soft set theory, neutrosophic set theory, and rough set theory are different mathematical models for handling uncertainties and they are mutually related. The neutrosophic soft rough set (NSRS) model is a hybrid model by combining neutrosophic soft sets with rough sets. We apply neutrosophic soft rough sets to graphs. In this research paper, we introduce the idea of neutrosophic soft rough graphs (NSRGs) and describe different methods of their construction. We consider the application of NSRG in decision-making problems. In particular, we develop efficient algorithms to solve decision-making problems. Full article