In graph theory, the concept of domination is essential in a variety of domains. It has broad applications in diverse fields such as coding theory, computer net work models, and school bus routing and facility lo cation problems. If a fuzzy graph fails to obtain acceptable results, neutrosophic sets and neutrosophic graphs can be used to model uncertainty correlated with indeterminate and inconsistent information in arbitrary real-world scenario. In this study, we consider the concept of domination (...) as it relates to single-valued neutrosophic incidence graphs (SVNIGs). Given the importance of domination and its utilization in numerous fields, we propose the application of dominating sets in SVNIG with valid edges. We present some relevant definitions such as those of valid edges, cardinality, and isolated vertices in SVNIG along with some examples. Furthermore, we also show a few significant sets connected to the dominating set in an SVNIG such as independent and irredundant sets. We also investigate a relationship between the concepts of dominating sets and domination numbers as well as irredundant and independence sets in SVNIGs. Finally, a real-life deployment of domination in SVNIGsis investigated in relation to COVID-19 vaccination locations as a practical application. (shrink)

Many results have been obtained on isolated graphs and complete graphs. In this paper, a necessary and sufficient condition will be proved for a single valued neutrosophic graph to be an isolated single valued neutrosophic graph.

In this research paper, the graph of the bipolar single-valued neutrosophic set model (BSVNS) is proposed. The graphs of single valued neutrosophic set models is generalized by this graph. For the BSVNS model, several results have been proved on complete and isolated graphs. Adding, an important and suitable condition for the graphs of the BSVNS model to become an isolated graph of the BSVNS model has been demonstrated.

In this paper, we propose a new concept named the uniform single valued neutrosophic graph. An illustrative example and some properties are examined. Next, we develop an algorithmic approach for computing the complement of the single valued neutrosophic graph. A numerical example is demonstrated for computing the complement of single valued neutrosophic graphs and uniform single valued neutrosophic graph.

Neutrosophic theory has many applications in graph theory, bipolar single valued neutrosophic graphs (BSVNGs) is the generalization of fuzzy graphs and intuitionistic fuzzy graphs, SVNGs. In this paper we introduce some types of BSVNGs, such as subdivision BSVNGs, middle BSVNGs, total BSVNGs and bipolar single valued neutrosophic line graphs (BSVNLGs), also investigate the isomorphism, co weak isomorphism and weak isomorphism properties of subdivision BSVNGs, middle BSVNGs, total BSVNGs and BSVNLGs.

Clustering plays an important role in data mining, pattern recognition, and machine learning. Then, single-valued neutrosophic sets are a useful means to describe and handle indeterminate and inconsistent information, which fuzzy sets and intuitionistic fuzzy sets cannot describe and deal with. To cluster the data represented by single-value neutrosophic information, the article proposes a single-valued neutrosophic minimum spanning tree clustering algorithm. Firstly, we defined a generalized distance measure between SVNSs. Then, we present (...) an SVNMST clustering algorithm for clustering single-value neutrosophic data based on the generalized distance measure of SVNSs. Finally, two illustrative examples are given to demonstrate the application and effectiveness of the developed approach. (shrink)

In this paper, we define the regular and totally regular bipolar single valued neutrosophic hypergraphs, and discuss the order and size along with properties of regular and totally regular bipolar single valued neutrosophic hypergraphs. We extend work on completeness of bipolar single valued neutrosophic hypergraphs.

This paper introduces a refined single-valued neutrosophic set (RSVNS) and presents a similarity measure of RSVNSs. Then a multicriteria decision-making method with RSVNS information is developed based on the similarity measure of RSVNSs. By the similarity measure between each alternative and the ideal solution (ideal alternative), all the alternatives can be ranked and the best one can be selected as well. Finally, an actual example on the selecting problems of construction projects demonstrates the application and effectiveness of (...) the proposed method. (shrink)

This work introduces the framework for selecting architecture in 5G networks, considering various technological, performance, economic, and operational factors. With the emergence of 5G technology, the architecture selection process has become pivotal in meeting diverse requirements for ultra-high-speed connectivity, low latency, scalability, and diverse service demands. The evaluation comprehensively analyses different architecture options, including centralized, distributed, cloud-based, and virtualized architectures. Factors such as network performance, scalability, cost-effectiveness, security, and compatibility are considered within a multi-criteria decision-making framework. Findings reveal each architecture (...) option's diverse strengths and limitations, emphasizing the importance of aligning architectural choices with specific use cases, deployment scenarios, and business objectives. We used the concept of multi-criteria decision-making (MCDM) methodology to control the various criteria. We used the single-valued neutrosophic set (SVNS) to deal with vague and inconsistent data. The SVNS is integrated with the hyperSoft set. The proposed methodology uses a single-valued neutrosophic hyperSoft set (SVNHSS) to select the best 5G architecture. We used the VIKOR method as an MCDM method to rank the alternatives. The proposed framework provides stakeholders with a structured methodology to evaluate and prioritize architecture options, facilitating informed decision-making in the complex landscape of 5G network deployments. (shrink)

In this paper, we introduce the notion of single-valued neutrosophic soft uniform spaces as a view point of the entourage approach. We investigate the relationship among single-valued neutrosophic soft uniformities, single-valued neutrosophic soft topologies and single-valued neutrosophic soft interior operators. Also, we study several single-valued neutrosophic soft topologies induced by a single-valued neutrosophic soft uniform space.

In this paper, we define the regular and totally regular single valued neutrosophic hypergraphs, and discuss the order and size along with properties of regular and totally regular single valued neutrosophic hypergraphs. We also extend work on completeness of single valued neutrosophic hypergraphs.

This paper introduces the concept of single-valued neutrosophic hyper \(BCK\)-subalgebras as a generalization and alternative of hyper \(BCK\)-algebras and on any given nonempty set constructs at least one single-valued neutrosophic hyper \(BCK\)-subalgebra and one a single-valued neutrosophic hyper \(BCK\)-ideal. In this study level subsets play the main role in the connection between singlevalued neutrosophic hyper \(BCK\)-subalgebras and hyper \(BCK\)-subalgebras and the connection between single-valued neutrosophic hyper \(BCK\)-ideals and (...) hyper \(BCK\)-ideals. The congruence and (strongly) regular equivalence relations are the important tools for connecting hyperstructures and structures, so the major contribution of this study is to apply and introduce a (strongly) regular relation on hyper \(BCK\)-algebras and to investigate their categorical properties (quasi commutative diagram) via single-valued neutrosophic hyper \(BCK\)-ideals. Indeed, by using the single-valued neutrosophic hyper \(BCK\)-ideals, we define a congruence relation on (weak commutative) hyper \(BCK\)-algebras that under some conditions is strongly regular and the quotient of any (single-valued neutrosophic)hyper \(BCK\)-(sub)algebra via this relation is a (single-valued neutrosophic)(hyper \(BCK\)-subalgebra) \(BCK\)-(sub)algebra. (shrink)

Clustering plays an important role in data mining, pattern recognition, and machine learning. Single-valued neutrosophic sets are useful means to describe and handle indeterminate and inconsistent information that fuzzy sets and intuitionistic fuzzy sets cannot describe and deal with. To cluster the data represented by single-valued neutrosophic information, this article proposes single-valued neutrosophic clustering methods based on similarity measures between SVNSs. First, we define a generalized distance measure between SVNSs and propose (...) two distance-based similarity measures of SVNSs. Then, we present a clustering algorithm based on the similarity measures of SVNSs to cluster single-valued neutrosophic data. Finally, an illustrative example is given to demonstrate the application and effectiveness of the developed clustering methods. (shrink)

On the basis of the combination of single-valued neutrosophic sets and hesitant fuzzy sets, this article proposes a single-valued neutrosophic hesitant fuzzy set as a further generalization of the concepts of fuzzy set, intuitionistic fuzzy set, single-valued neutrosophic set, hesitant fuzzy set, and dual hesitant fuzzy set. Then, we introduce the basic operational relations and cosine measure function of SVNHFSs. Also, we develop a single-valued neutrosophic hesitant fuzzy weighted (...) averaging operator and a single-valued neutrosophic hesitant fuzzy weighted geometric operator and investigate their properties. Furthermore, a multiple-attribute decision-making method is established on the basis of the SVNHFWA and SVNHFWG operators and the cosine measure under a single-valued neutrosophic hesitant fuzzy environment. Finally, an illustrative example of investment alternatives is given to demonstrate the application and effectiveness of the developed approach. (shrink)

In this paper, we propose some transfor mations based on the centroid points between single valued neutrosophic numbers. We introduce these trans formations according to truth, indeterminacy and falsity value of single valued neutrosophic numbers. We propose a new similarity measure based on falsity value between single valued neutrosophic sets. Then we prove some properties on new similarity measure based on falsity value between falsity value between single valued (...) class='Hi'>neutrosophic sets. Furthermore, we propose similarity measure based on falsity value between single valued neutrosophic sets based on the centroid points of transformed single valued neutrosophic numbers. We also apply the proposed similarity measure between single valued neutrosophic sets to deal with pattern recognition problems. (shrink)

This book represents the fourth volume in the series Collected Papers on Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond. This volume specifically delves into the concept of the HyperUncertain Set, building on the foundational advancements introduced in previous volumes. The series aims to explore the ongoing evolution of uncertain combinatorics through innovative methodologies such as graphization, hyperization, and uncertainization. These approaches integrate and extend core concepts from fuzzy, neutrosophic, soft, and rough (...) set theories, providing robust frameworks to model and analyze the inherent complexity of real-world uncertainties. At the heart of this series lies combinatorics and set theory—cornerstones of mathematics that address the study of counting, arrangements, and the relationships between collections under defined rules. Traditionally, combinatorics has excelled in solving problems involving uncertainty, while advancements in set theory have expanded its scope to include powerful constructs like fuzzy and neutrosophic sets. These advanced sets bring new dimensions to uncertainty modeling by capturing not just binary truth but also indeterminacy and falsity. In this fourth volume, the integration of set theory with graph theory takes center stage, culminating in "graphized" structures such as hypergraphs and superhypergraphs. These structures, paired with innovations like Neutrosophic Oversets, Undersets, Offsets, and the Nonstandard Real Set, extend the boundaries of mathematical abstraction. This fusion of combinatorics, graph theory, and uncertain set theory creates a rich foundation for addressing the multidimensional and hierarchical uncertainties prevalent in both theoretical and applied domains. The book is structured into thirteen chapters, each contributing unique perspectives and advancements in the realm of HyperUncertain Sets and their related frameworks. -/- The first chapter (Advancing Traditional Set Theory with Hyperfuzzy, Hyperneutrosophic, and Hyperplithogenic Sets) explores the evolution of classical set theory to better address the complexity and ambiguity of real-world phenomena. By introducing hierarchical structures like hyperstructures and superhyperstructures—created through iterative applications of power sets—it lays the groundwork for more abstract and adaptable mathematical tools. The focus is on extending three foundational frameworks: Fuzzy Sets, Neutrosophic Sets, and Plithogenic Sets into their hyperforms: Hyperfuzzy Sets, Hyperneutrosophic Sets, and Hyperplithogenic Sets. These advanced concepts are applied across diverse fields such as statistics, clustering, evolutionary theory, topology, decision-making, probability, and language theory. The goal is to provide a robust platform for future research in this expanding area of study. The second chapter (Applications and Mathematical Properties of Hyperneutrosophic and SuperHyperneutrosophic Sets) extends the work on Hyperfuzzy, Hyperneutrosophic, and Hyperplithogenic Sets by delving into their advanced applications and mathematical foundations. Building on prior research, it specifically examines Hyperneutrosophic and SuperHyperneutrosophic Sets, exploring their integration into: Neutrosophic Logic, Cognitive Maps,Graph Neural Networks, Classifiers, and Triplet Groups. The chapter also investigates their mathematical properties and applicability in addressing uncertainties and complexities inherent in various domains. These insights aim to inspire innovative uses of hypergeneralized sets in modern theoretical and applied research. The third chapter (New Extensions of Hyperneutrosophic Sets – Bipolar, Pythagorean, Double-Valued, and Interval-Valued Sets) studies advanced variations of Neutrosophic Sets, a mathematical framework defined by three membership functions: truth (T), indeterminacy (I), and falsity (F). By leveraging the concepts of Hyperneutrosophic and SuperHyperneutrosophic Sets, the study extends: Bipolar Neutrosophic Sets, Interval-Valued Neutrosophic Sets, Pythagorean Neutrosophic Sets, and Double-Valued Neutrosophic Sets. These extensions address increasingly complex scenarios, and a brief analysis is provided to explore their potential applications and mathematical underpinnings. Building on prior research, the fourth chapter (Hyperneutrosophic Extensions of Complex, Single-Valued Triangular, Fermatean, and Linguistic Sets) expands on Neutrosophic Set theory by incorporating recent advancements in Hyperneutrosophic and SuperHyperneutrosophic Sets. The study focuses on extending: Complex Neutrosophic Sets, Single-Valued Triangular Neutrosophic Sets, Fermatean Neutrosophic Sets, and Linguistic Neutrosophic Sets. The analysis highlights the mathematical structures of these hyperextensions and explores their connections with existing set-theoretic concepts, offering new insights into managing uncertainty in multidimensional challenges. The fifth chapter (Advanced Extensions of Hyperneutrosophic Sets – Dynamic, Quadripartitioned, Pentapartitioned, Heptapartitioned, and m-Polar) delves deeper into the evolution of Neutrosophic Sets by exploring advanced frameworks designed for even more intricate applications. New extensions include: Dynamic Neutrosophic Sets, Quadripartitioned Neutrosophic Sets, Pentapartitioned Neutrosophic Sets, Heptapartitioned Neutrosophic Sets, and m-Polar Neutrosophic Sets. These developments build upon foundational research and aim to provide robust tools for addressing multidimensional and highly nuanced problems. The sixth chapter (Advanced Extensions of Hyperneutrosophic Sets – Cubic, Trapezoidal, q-Rung Orthopair, Overset, Underset, and Offset) builds upon the Neutrosophic framework, which employs truth (T), indeterminacy (I), and falsity (F) to address uncertainty. Leveraging advancements in Hyperneutrosophic and SuperHyperneutrosophic Sets, the study extends: Cubic Neutrosophic Sets, Trapezoidal Neutrosophic Sets, q-Rung Orthopair Neutrosophic Sets, Neutrosophic Oversets, Neutrosophic Undersets, and Neutrosophic Offsets. The chapter provides a brief analysis of these new set types, exploring their properties and potential applications in solving multidimensional problems. The seventh chapter (Specialized Classes of Hyperneutrosophic Sets – Support, Paraconsistent, and Faillibilist Sets) delves into unique classes of Neutrosophic Sets extended through Hyperneutrosophic and SuperHyperneutrosophic frameworks to tackle advanced theoretical challenges. The study introduces and extends: Support Neutrosophic Sets, Neutrosophic Intuitionistic Sets, Neutrosophic Paraconsistent Sets, Neutrosophic Faillibilist Sets, Neutrosophic Paradoxist and Pseudo-Paradoxist Sets, Neutrosophic Tautological and Nihilist Sets, Neutrosophic Dialetheist Sets, and Neutrosophic Trivialist Sets. These extensions address highly nuanced aspects of uncertainty, further advancing the theoretical foundation of Neutrosophic mathematics. The eight chapter (MultiNeutrosophic Sets and Refined Neutrosophic Sets) focuses on two advanced Neutrosophic frameworks: MultiNeutrosophic Sets, and Refined Neutrosophic Sets. Using Hyperneutrosophic and nn-SuperHyperneutrosophic Sets, these extensions are analyzed in detail, highlighting their adaptability to multidimensional and complex scenarios. Examples and mathematical properties are provided to showcase their practical relevance and theoretical depth. The ninth chapter (Advanced Hyperneutrosophic Set Types – Type-m, Nonstationary, Subset-Valued, and Complex Refined) explores extensions of the Neutrosophic framework, focusing on: Type-m Neutrosophic Sets, Nonstationary Neutrosophic Sets, Subset-Valued Neutrosophic Sets, and Complex Refined Neutrosophic Sets. These extensions utilize the Hyperneutrosophic and SuperHyperneutrosophic frameworks to address advanced challenges in uncertainty management, expanding their mathematical scope and practical applications. The tenth chapter (Hyperfuzzy Hypersoft Sets and Hyperneutrosophic Hypersoft Sets) integrates the principles of Fuzzy, Neutrosophic, and Soft Sets with hyperstructures to introduce: Hyperfuzzy Hypersoft Sets, and Hyperneutrosophic Hypersoft Sets. These frameworks are designed to manage complex uncertainty through hierarchical structures based on power sets, with detailed analysis of their properties and theoretical potential. The eleventh chapter (A Review of SuperFuzzy, SuperNeutrosophic, and SuperPlithogenic Sets) revisits and extends the study of advanced set concepts such as: SuperFuzzy Sets, Super-Intuitionistic Fuzzy Sets,Super-Neutrosophic Sets, and SuperPlithogenic Sets, including their specialized variants like quadripartitioned, pentapartitioned, and heptapartitioned forms. The work serves as a consolidation of existing studies while highlighting potential directions for future research in hierarchical uncertainty modeling. Focusing on decision-making under uncertainty, the tweve chapter (Advanced SuperHypersoft and TreeSoft Sets) introduces six novel concepts: SuperHypersoft Rough Sets,SuperHypersoft Expert Sets, Bipolar SuperHypersoft Sets, TreeSoft Rough Sets, TreeSoft Expert Sets, and Bipolar TreeSoft Sets. Definitions, properties, and potential applications of these frameworks are explored to enhance the flexibility of soft set-based models. The final chapter (Hierarchical Uncertainty in Fuzzy, Neutrosophic, and Plithogenic Sets) provides a comprehensive survey of hierarchical uncertainty frameworks, with a focus on Plithogenic Sets and their advanced extensions: Hyperplithogenic Sets, SuperHyperplithogenic Sets. It examines relationships with other major concepts such as Intuitionistic Fuzzy Sets, Vague Sets, Picture Fuzzy Sets, Hesitant Fuzzy Sets, and multi-partitioned Neutrosophic Sets, consolidating their theoretical interconnections for modeling complex systems. This volume not only reflects the dynamic interplay between theoretical rigor and practical application but also serves as a beacon for future research in uncertainty modeling, offering advanced tools to tackle the intricacies of modern challenges. (shrink)

As a generalization of both single-valued neutrosophic element and hesitant fuzzy element, single-valued neutrosophic hesitant fuzzy element is an efficient tool for describing uncertain and imprecise information. Thus, it is of great significance to deal with single-valued neutrosophic hesitant fuzzy information for many practical problems. In this paper, we study the aggregation of SVNHFEs based on some normalized operations from geometric viewpoint. Firstly, two normalized operations are defined for processing SVNHFEs. Then, (...) a series of normalized aggregation operators which fulfill some basic conditions of a valid aggregation operator are proposed. Additionally, a decision-making method is developed for resolving multiattribute decision-making problems based on the proposed operators. Finally, a numerical example is provided to illustrate the feasibility and effectiveness of the method. (shrink)

This book is the sixth volume in the series of Collected Papers on Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond. Building upon the foundational contributions of previous volumes, this edition focuses on the exploration and development of Various New Uncertain Concepts, further enriching the study of uncertainty and complexity through innovative theoretical advancements and practical applications. The volume is meticulously organized into 15 chapters, each presenting unique perspectives and contributions to the field. (...) From theoretical explorations to real-world applications, these chapters provide a cohesive and comprehensive overview of the state of the art in uncertain combinatorics, emphasizing the versatility and power of the newly introduced concepts and methodologies. The first chapter (SuperHypertree-depth – Structural Analysis in SuperHyperGraphs) explores the concept of SuperHypertree-depth, an extension of the classical graph parameter Tree-depth and its hypergraph counterpart Hypertree-depth. By introducing hierarchical nesting within SuperHyperGraphs, where both vertices and edges can represent recursive subsets, this study investigates the mathematical properties and structural implications of these extended parameters. The findings highlight the relationships between SuperHypertree-depth and its traditional graph-theoretic equivalents, providing a deeper understanding of their applicability to hierarchical and complex systems. The second chapter (Obstructions for Hypertree-width and SuperHypertree-width) examines the role of ultrafilters as obstructions in determining Hypertree-width and extends the concept to SuperHypertree-width. Building on hypergraph theory, which abstracts traditional graph frameworks into more complex domains, the study investigates how recursive structures within SuperHyperGraphs redefine the computational and structural properties of these parameters. Ultrafilters, with their broad mathematical significance, serve as critical tools for understanding the limitations and potentials of these advanced graph metrics. The third chapter (SuperHypertree-Length and SuperHypertree-Breadth in SuperHyperGraphs) investigates the extension of the graph-theoretic parameters Tree-length and Tree-breadth to the realms of hypergraphs and SuperHyperGraphs. By leveraging the hierarchical nesting of SuperHyperGraphs, the study explores how these parameters adapt to increasingly complex and multi-level structures. Comparative analyses between these extended parameters and their classical counterparts reveal new insights into their relevance and utility in advanced graph and hypergraph theory. Plithogenic Sets, which generalize Fuzzy and Neutrosophic Sets, are extended in the fourth chapter (Extended HyperPlithogenic Sets and Generalized Plithogenic Graphs) to Extended Plithogenic Sets, HyperPlithogenic Sets, and SuperHyperPlithogenic Sets. This study further investigates their application to graph theory through the concepts of Extended Plithogenic Graphs and Generalized Extended Plithogenic Graphs. The chapter provides a concise exploration of these frameworks, offering insights into their potential for addressing uncertainty and complexity in graph structures. Soft Sets provide an effective framework for decision-making by mapping parameters to subsets of a universal set, addressing uncertainty and vagueness. The fifth chapter (Double-Framed Superhypersoft Set and Double-Framed Treesoft Set) introduces the Double-Framed SuperHypersoft Set and the Double-Framed Treesoft Set as extensions of traditional and advanced soft set frameworks, such as Hypersoft and SuperHypersoft Sets. The chapter explores their relationships with existing concepts, offering new tools to handle complex decision-making scenarios with enhanced structural flexibility. The sixth paper (HyperPlithogenic Cubic Set and SuperHyperPlithogenic Cubic Set) introduces the concepts of the HyperPlithogenic Cubic Set and SuperHyperPlithogenic Cubic Set, which extend the Plithogenic Cubic Set by integrating both interval-valued and single-valued fuzzy memberships. These sets leverage multi-attribute aggregation techniques inherent to plithogenic structures, allowing for nuanced representations of uncertainty. Additionally, related constructs such as the HyperPlithogenic Fuzzy Cubic Set, HyperPlithogenic Intuitionistic Fuzzy Cubic Set, and HyperPlithogenic Neutrosophic Cubic Set are explored, further enriching the theoretical and practical applications of this framework. The seventh chapter (L-Neutrosophic Sets and Nonstationary Neutrosophic Sets) extends the foundational concepts of fuzzy sets by integrating Neutrosophic and Plithogenic frameworks. By introducing L-Neutrosophic Sets and Nonstationary Neutrosophic Sets, the study enhances the representation of uncertainty through independent membership components: truth, indeterminacy, and falsity. These advanced constructs also incorporate multi-dimensional and contradictory attributes, providing a robust means of modeling complex decision-making and uncertain data. Plithogenic and Rough Sets, known for generalizing uncertainty modeling and classification, are extended in the eight chapter (Forest HyperPlithogenic and Forest HyperRough Sets) to Forest HyperPlithogenic Sets, Forest SuperHyperPlithogenic Sets, Forest HyperRough Sets, and Forest SuperHyperRough Sets. These frameworks incorporate hierarchical and recursive structures to advance existing set-theoretic paradigms. The chapter explores their applications in multi-level data analysis and uncertainty classification, demonstrating their adaptability to complex systems. Building on Fuzzy, Neutrosophic, and Plithogenic Sets, the tenth chapter (Symbolic HyperPlithogenic Sets) introduces Symbolic HyperPlithogenic Sets and Symbolic n-SuperHyperPlithogenic Sets. These sets incorporate symbolic components and algebraic coefficients, enabling flexible operations within a defined prevalence order. By extending symbolic representation into hyperplithogenic and superhyperplithogenic domains, the chapter opens new pathways for addressing uncertainty and hierarchical complexity in mathematical modeling. Soft Sets, designed to manage uncertainty and imprecision, have evolved through various extensions like Hypersoft Sets and SuperHypersoft Sets. The eleventh chapter (N-SuperHypersoft and Bijective SuperHypersoft Sets) introduces N-SuperHypersoft Sets, N-Treesoft Sets, Bijective SuperHypersoft Sets, and Bijective Treesoft Sets. These new constructs enhance decision-making frameworks by incorporating advanced hierarchical and bijective relationships, building on existing theories and expanding their applications. Plithogenic Sets, known for integrating multi-valued attributes and contradictions, and Rough Sets, which partition data into definable approximations, are combined in the twelfth chapter (Plithogenic Rough Sets) to form Plithogenic Rough Sets. This fusion provides a powerful framework for addressing uncertainty in dynamic and complex decision-making scenarios, offering a novel approach to uncertainty modeling. Expanding on Neutrosophic Sets, which represent truth, indeterminacy, and falsehood, this chapter introduces Plithogenic Duplets and Plithogenic Triplets. These constructs leverage the Plithogenic framework to incorporate attributes, values, and contradiction measures. The thirteenth chapter (Plithogenic Duplets and Triplets) examines their relationships with Neutrosophic Duplets and Triplets, offering new tools for multi-dimensional data representation and decision-making. Building on foundational concepts like Rough Sets and Vague Sets, the fourteenth chapter (SuperRough and SuperVague Sets) introduces SuperRough Sets and SuperVague Sets. These generalized frameworks extend uncertainty modeling by incorporating hierarchical structures. The study also demonstrates that SuperRough Sets can evolve into SuperHyperRough Sets, providing further generalizations for advanced data classification and analysis. The fifteenth chapter (Neutrosophic TreeSoft Expert and ForestSoft Sets) revisits the Neutrosophic TreeSoft Set, which combines the hierarchical structure of TreeSoft Sets with the Neutrosophic framework for uncertainty representation. Additionally, it introduces the Neutrosophic TreeSoft Expert Set, incorporating expert knowledge into the model. The chapter also explores the ForestSoft Set and its extension, the Neutrosophic ForestSoft Set, to provide multi-level, tree-structured approaches for complex data representation and analysis. (shrink)

Gathering the attitudes of the examined respondents would be very significant in some evaluation models. Therefore, a multiple criteria approach based on the use of the neutrosophic set is considered in this paper. An example of the evaluation of restaurants is considered at the end of this paper with the aim to present in detail the proposed approach.

Neutrosophic theory and its applications have been expanding in all directions at an astonishing rate especially after of the introduction the journal entitled “Neutrosophic Sets and Systems”. New theories, techniques, algorithms have been rapidly developed. One of the most striking trends in the neutrosophic theory is the hybridization of neutrosophic set with other potential sets such as rough set, bipolar set, soft set, hesitant fuzzy set, etc. The different hybrid structures such as rough neutrosophic set, (...) single valued neutrosophic rough set, bipolar neutrosophic set, single valued neutrosophic hesitant fuzzy set, etc. are proposed in the literature in a short period of time. Neutrosophic set has been an important tool in the application of various areas such as data mining, decision making, e-learning, engineering, medicine, social science, and some more. (shrink)

Neutrosophic set has been derived from a new branch of philosophy, namely Neutrosophy. Neutrosophic set is capable of dealing with uncertainty, indeterminacy and inconsistent information. Neutrosophic set approaches are suitable to modeling problems with uncertainty, indeterminacy and inconsistent information in which human knowledge is necessary, and human evaluation is needed. Neutrosophic set theory firstly proposed in 1998 by Florentin Smarandache, who also developed the concept of single valued neutrosophic set, oriented towards real world (...) scientific and engineering applications. Since then, the single valued neutrosophic set theory has been extensively studied in books and monographs introducing neutrosophic sets and its applications, by many authors around the world. (shrink)

In this paper, the cosine similarity measure of neutrosophic refined (multi-) sets is proposed and its properties are studied. The concept of this cosine similarity measure of neutrosophic refined sets is the extension of improved cosine similarity measure of single valued neutrosophic. Finally, using this cosine similarity measure of neutrosophic refined set, the application of medical diagnosis is presented.

Neutrosophic set has been derived from a new branch of philosophy, namely Neutrosophy. Neutrosophic set is capable of dealing with uncertainty, indeterminacy and inconsistent information. Neutrosophic set approaches are suitable to modeling problems with uncertainty, indeterminacy and inconsistent information in which human knowledge is necessary, and human evaluation is needed. Neutrosophic set theory was firstly proposed in 1998 by Florentin Smarandache, who also developed the concept of single valued neutrosophic set, oriented towards real (...) world scientific and engineering applications. Since then, the single valued neutrosophic set theory has been extensively studied in books and monographs, the properties of neutrosophic sets and their applications, by many authors around the world. Also, an international journal - Neutrosophic Sets and Systems started its journey in 2013. Neutrosophic triplet was first defined in 2016 by Florentin Smarandache and Mumtaz Ali and they also introduced the neutrosophic triplet groups in the same year. For every element “x” in a neutrosophic triplet set A, there exist a neutral of “x” and an opposite of “x”. Also, neutral of “x” must be different from the classical neutral element. Therefore, the NT set is different from the classical set. Furthermore, a NT of “x” is showed by . This first volume collects original research and applications from different perspectives covering different areas of neutrosophic studies, such as decision making, Triplet, topology, and some theoretical papers. This volume contains three sections: NEUTROSOPHIC TRIPLET, DECISION MAKING, AND OTHER PAPERS. (shrink)

In this paper, one extends the single-valued complex neutrosophic set to the subsetvalued complex neutrosophic set, and afterwards to the subset-valued complex refined neutrosophic set.

In this paper, we introduce the integer programming in neutrosophic environment, by considering coffecients of problem as a triangulare neutrosophic numbers. The degrees of acceptance, indeterminacy and rejection of objectives are simultaneously considered. The Neutrosophic Integer Programming Problem (NIP) is transformed into a crisp programming model, using truth membership (T), indeterminacy membership (I), and falsity membership (F) functions as well as single valued triangular neutrosophic numbers. To measure the efficiency of the model, we solved (...) several numerical examples. (shrink)

In this paper, multi attribute decision making problem based on grey relational analysis in neutrosophic cubic set environment is investigated. In the decision making situation, the attribute weights are considered as single valued neutrosophic sets. The neutrosophic weights are converted into crisp weights. Both positve and negative GRA coefficients, and weighted GRA coefficients are determined. Hamming distances for weighted GRA coefficients and standard (ideal) GRA coefficients are determined. The relative closeness coefficients are derived in order (...) to rank the alternatives. The relative closeness coefficients are designed in ascending order. Finally, a numerical example is solved to demonstrate the applicability of the proposed approach. (shrink)

Cloud computing (ClC) has become a more popular computer paradigm in the preceding few years. Quality of Service (QoS) is becoming a crucial issue in service alteration because of the rapid growth in the number of cloud services. When evaluating cloud service functioning using several performance measures, the issue becomes more complex and non-trivial. It is therefore quite difficult and crucial for consumers to choose the best cloud service. The user's choices are provided in a quantifiable manner in the current (...) methods for choosing cloud services. Hence, this study attempts to achieve this objective through construction. decision-making framework so-called cloud services evaluator (CSsEv). The main indicator and its sub-indicators are formed as nodes at levels(n) in tree soft sets (TSSs). Thereafter Single Value Neutrosophic Sets (SVNSs) as branch of neutrosophic sets which conjunction with the Multi-Criteria Decision Making (MCDM) technique to facilitate analysis and evaluation process for the available Cloud services providers. Hence, entropy is employed to obtain indicators and sub_indicators weights and Complex Proportional Assessment utilizes these weights to facilitate the decision process of selecting optimal ClSPs. (shrink)

The n-th PowerSet is used in defining the SuperHyperOperation, SuperHyperAxiom, and their corresponding Neutrosophic SuperHyperOperation, Neutrosophic SuperHyperAxiom in order to build the SuperHyperAlgebra and Neutrosophic SuperHyperAlgebra. In general, in any field of knowledge, one in fact encounters SuperHyperStructures. Also, six new types of topologies have been introduced in the last years (2019-2022), such as: Refined Neutrosophic Topology, Refined Neutrosophic Crisp Topology, NeutroTopology, AntiTopology, SuperHyperTopology, and Neutrosophic SuperHyperTopology. Neutrosophic set has been derived from a (...) new branch of philosophy, namely Neutrosophy. Neutrosophic set is capable of dealing with uncertainty, indeterminacy and inconsistent information. Neutrosophic set approaches are suitable to modeling problems with uncertainty, indeterminacy and inconsistent information in which human knowledge is necessary, and human evaluation is needed. Neutrosophic set theory firstly proposed in 1998 by Florentin Smarandache, who also developed the concept of single valued neutrosophic set, oriented towards real world scientific and engineering applications. Since then, the single valued neutrosophic set theory has been extensively studied in books and monographs introducing neutrosophic sets and its applications, by many authors around the world. Also, an international journal - Neutrosophic Sets and Systems started its journey in 2013. This first volume collects original research and applications from different perspectives covering different areas of neutrosophic studies, such as decision-making, neutroalgebra, neutro metric, and some theoretical papers. (shrink)

The topics approached in this collection of papers are: neutrosophic sets; neutrosophic logic; generalized neutrosophic set; neutrosophic rough set; multigranulation neutrosophic rough set (MNRS); neutrosophic cubic sets; triangular fuzzy neutrosophic sets (TFNSs); probabilistic single-valued (interval) neutrosophic hesitant fuzzy set; neutro-homomorphism; neutrosophic computation; quantum computation; neutrosophic association rule; data mining; big data; oracle Turing machines; recursive enumerability; oracle computation; interval number; dependent degree; possibility degree; power aggregation operators; multi-criteria group (...) decision-making (MCGDM); expert set; soft sets; LA-semihypergroups; single valued trapezoidal neutrosophic number; inclusion relation; Q-linguistic neutrosophic variable set; vector similarity measure; fundamental neutro-homomorphism theorem; neutro-isomorphism theorem; quasi neutrosophic triplet loop; quasi neutrosophic triplet group; BE-algebra; cloud model; fuzzy measure; clustering algorithm; and many more. (shrink)

Neutrosophic theory and its applications have been expanding in all directions at an astonishing rate especially after of the introduction the journal entitled “Neutrosophic Sets and Systems”. New theories, techniques, algorithms have been rapidly developed. One of the most striking trends in the neutrosophic theory is the hybridization of neutrosophic set with other potential sets such as rough set, bipolar set, soft set, hesitant fuzzy set, etc. The different hybrid structures such as rough neutrosophic set, (...) single valued neutrosophic rough set, bipolar neutrosophic set, single valued neutrosophic hesitant fuzzy set, etc. are proposed in the literature in a short period of time. Neutrosophic set has been an important tool in the application of various areas such as data mining, decision making, e-learning, engineering, law, medicine, social science, and some more. -/- This book explores the emerging field of Neutrosophic Algebraic Structures, focusing on both their theoretical foundations and practical applications. We apply innovative algorithmic methods to investigate the complex interactions of neutrosophic elements, such as neutrosophic numbers, sets, and functions, within algebraic systems. Our goal is to show how neutrosophic structures challenge and expand traditional algebraic approaches, offering solutions to problems across diverse fields like computer science, engineering, artificial intelligence, and decision-making. (shrink)

In this paper, we make distinctions between Classical Logic (where the propositions are 100% true, or 100 false) and the Neutrosophic Logic (where one deals with partially true, partially indeterminate and partially false propositions) in order to respond to K. Georgiev’s criticism [1]. We recall that if an axiom is true in a classical logic system, it is not necessarily that the axiom be valid in a modern (fuzzy, intuitionistic fuzzy, neutrosophic etc.) logic system.

The topics approached in the 52 papers included in this book are: neutrosophic sets; neutrosophic logic; generalized neutrosophic set; neutrosophic rough set; multigranulation neutrosophic rough set (MNRS); neutrosophic cubic sets; triangular fuzzy neutrosophic sets (TFNSs); probabilistic single-valued (interval) neutrosophic hesitant fuzzy set; neutro-homomorphism; neutrosophic computation; quantum computation; neutrosophic association rule; data mining; big data; oracle Turing machines; recursive enumerability; oracle computation; interval number; dependent degree; possibility degree; power aggregation (...) operators; multi-criteria group decision-making (MCGDM); expert set; soft sets; LA-semihypergroups; single valued trapezoidal neutrosophic number; inclusion relation; Q-linguistic neutrosophic variable set; vector similarity measure; fundamental neutro-homomorphism theorem; neutro-isomorphism theorem; quasi neutrosophic triplet loop; quasi neutrosophic triplet group; BE-algebra; cloud model; Maclaurin symmetric mean; pseudo-BCI algebra; hesitant fuzzy set; photovoltaic plan; decision-making trial and evaluation laboratory (DEMATEL); Choquet integral; fuzzy measure; clustering algorithm; and many more. (shrink)

In this paper, we defined (I,T) − standard neutrosophic rough sets based on an implicator I and a t-norm T on I; lower and upper approximations of standard neutrosophic sets in a standard neutrosophic approximation are defined. Some properties of (I,T) − standard neutrosophic rough sets are investigated. We consider the case when the neutrosophic components (truth, indeterminacy, and falsehood) are totally dependent, single-valued, and hence their sum is ≤ 1.

In this paper, we present an expansion of one of the well-known classical inventory management models, which is the static model of inventory management without a deficit and for a single substance, based on the neutrosophic logic, where we provide through this study a basis for dealing with all data, whether specific or undefined in the field of inventory management, as it provides safe environment to manage inventory without running into deficit , and give us an approximate ideal (...) volume of inventory. Since the ideal size is affected by the rate of demand for inventory, we present in this paper a study of the rate of demand for inventory when it is not precisely refined, and we find that the indeterminate values of the demand rate cannot be ignored, because they actually affect determining the ideal size of inventory and calculating its costs, thus affecting on the efficiency of the facility and achieve great profits for it. (shrink)

The second volume of “Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond” presents a deep exploration of the progress in uncertain combinatorics through innovative methodologies like graphization, hyperization, and uncertainization. This volume integrates foundational concepts from fuzzy, neutrosophic, soft, and rough set theory, among others, to further advance the field. Combinatorics and set theory, two central pillars of mathematics, focus on counting, arrangement, and the study of collections under defined rules. Combinatorics excels (...) in handling uncertainty, while set theory has evolved with concepts such as fuzzy and neutrosophic sets, which enable the modeling of complex real-world uncertainties by addressing truth, indeterminacy, and falsehood. These advancements, when combined with graph theory, give rise to novel forms of uncertain sets in "graphized" structures, including hypergraphs and superhypergraphs. Innovations such as Neutrosophic Oversets, Undersets, and Offsets, as well as the Nonstandard Real Set, build upon traditional graph concepts, pushing both theoretical and practical boundaries. The synthesis of combinatorics, set theory, and graph theory in this volume provides a robust framework for addressing the complexities and uncertainties inherent in both mathematical and real-world systems, paving the way for future research and application. In the first chapter, “A Review of the Hierarchy of Plithogenic, Neutrosophic, and Fuzzy Graphs: Survey and Applications”, the authors investigate the interrelationships among various graph classes, including Plithogenic graphs, and explore other related structures. Graph theory, a fundamental branch of mathematics, focuses on networks of nodes and edges, studying their paths, structures, and properties. A Fuzzy Graph extends this concept by assigning a membership degree between 0 and 1 to each edge and vertex, representing the level of uncertainty. The Turiyam Neutrosophic Graph is introduced as an extension of both Neutrosophic and Fuzzy Graphs, while Plithogenic graphs offer a potent method for managing uncertainty. The second chapter, “Review of Some Superhypergraph Classes: Directed, Bidirected, Soft, and Rough”, examines advanced graph structures such as directed superhypergraphs, bidirected hypergraphs, soft superhypergraphs, and rough superhypergraphs. Classical graph classes include undirected graphs, where edges lack orientation, and directed graphs, where edges have specific directions. Recent innovations, including bidirected graphs, have sparked ongoing research and significant advancements in the field. Soft Sets and their extension to Soft Graphs provide a flexible framework for managing uncertainty, while Rough Sets and Rough Graphs address uncertainty by using lower and upper approximations to handle imprecise data. Hypergraphs generalize traditional graphs by allowing edges, or hyperedges, to connect more than two vertices. Superhypergraphs further extend this by allowing both vertices and edges to represent subsets, facilitating the modeling of hierarchical and group-based relationships. The third chapter, “Survey of Intersection Graphs, Fuzzy Graphs, and Neutrosophic Graphs”, explores the intersection graph models within the realms of Fuzzy Graphs, Intuitionistic Fuzzy Graphs, Neutrosophic Graphs, Turiyam Neutrosophic Graphs, and Plithogenic Graphs. The chapter highlights their mathematical properties and interrelationships, reflecting the growing number of graph classes being developed in these areas. Intersection graphs, such as Unit Square Graphs, Circle Graphs, and Ray Intersection Graphs, are crucial for understanding complex graph structures in uncertain environments. The fourth chapter, “Fundamental Computational Problems and Algorithms for SuperHyperGraphs”, addresses optimization problems within the SuperHypergraph framework, such as the SuperHypergraph Partition Problem, Reachability, and Minimum Spanning SuperHypertree. The chapter also adapts classical problems like the Traveling Salesman Problem and the Chinese Postman Problem to the SuperHypergraph context, exploring how hypergraphs, which allow hyperedges to connect more than two vertices, can be used to solve complex hierarchical and relational problems. The fifth chapter, “A Short Note on the Basic Graph Construction Algorithm for Plithogenic Graphs”, delves into algorithms designed for Plithogenic Graphs and Intuitionistic Plithogenic Graphs, analyzing their complexity and validity. Plithogenic Graphs model multi-valued attributes by incorporating membership and contradiction functions, offering a nuanced representation of complex relationships. The sixth chapter, “Short Note of Bunch Graph in Fuzzy, Neutrosophic, and Plithogenic Graphs”, generalizes traditional graph theory by representing nodes as groups (bunches) rather than individual entities. This approach enables the modeling of both competition and collaboration within a network. The chapter explores various uncertain models of bunch graphs, including Fuzzy Graphs, Neutrosophic Graphs, Turiyam Neutrosophic Graphs, and Plithogenic Graphs. In the seventh chapter, “A Reconsideration of Advanced Concepts in Neutrosophic Graphs: Smart, Zero Divisor, Layered, Weak, Semi, and Chemical Graphs”, the authors extend several fuzzy graph classes to Neutrosophic graphs and analyze their properties. Neutrosophic Graphs, a generalization of fuzzy graphs, incorporate degrees of truth, indeterminacy, and falsity to model uncertainty more effectively. The eighth chapter, “Short Note of Even-Hole-Graph for Uncertain Graph”, focuses on Even-Hole-Free and Meyniel Graphs analyzed within the frameworks of Fuzzy, Neutrosophic, Turiyam Neutrosophic, and Plithogenic Graphs. The study investigates the structure of these graphs, with an emphasis on their implications for uncertainty modeling. The ninth chapter, “Survey of Planar and Outerplanar Graphs in Fuzzy and Neutrosophic Graphs”, explores planar and outerplanar graphs, as well as apex graphs, within the contexts of fuzzy, neutrosophic, Turiyam Neutrosophic, and plithogenic graphs. The chapter examines how these types of graphs are used to model uncertain parameters and relationships in mathematical and real-world systems. The tenth chapter, “General Plithogenic Soft Rough Graphs and Some Related Graph Classes”, introduces and explores new concepts such as Turiyam Neutrosophic Soft Graphs and General Plithogenic Soft Graphs. The chapter also examines models of uncertain graphs, including Fuzzy, Intuitionistic Fuzzy, Neutrosophic, and Plithogenic Graphs, all designed to handle uncertainty in diverse contexts. The eleventh chapter, “Survey of Trees, Forests, and Paths in Fuzzy and Neutrosophic Graphs”, provides a comprehensive study of Trees, Forests, and Paths within the framework of Fuzzy and Neutrosophic Graphs. This chapter focuses on classifying and analyzing graph structures like trees and paths in uncertain environments, contributing to the ongoing development of graph theory in the context of uncertainty. (shrink)

The third volume of “Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond” presents an in-depth exploration of the cutting-edge developments in uncertain combinatorics and set theory. This comprehensive collection highlights innovative methodologies such as graphization, hyperization, and uncertainization, which enhance combinatorics by incorporating foundational concepts from fuzzy, neutrosophic, soft, and rough set theories. These advancements open new mathematical horizons, offering novel approaches to managing uncertainty within complex systems. Combinatorics, a discipline focused on (...) counting, arrangement, and structure, often faces challenges when uncertainty is present. Set theory, which underpins combinatorial problems, has evolved to tackle these challenges. The introduction of fuzzy and neutrosophic sets has expanded the toolkit for modeling uncertainty by incorporating elements of truth, indeterminacy, and falsehood into decision-making processes. These innovations seamlessly intersect with graph theory, providing new ways to represent uncertain structures through "graphized" forms such as hypergraphs and superhypergraphs. This volume also introduces advanced concepts like Neutrosophic Oversets, Undersets, and Offsets, which push the boundaries of classical graph theory and offer deeper insights into the mathematical and practical challenges posed by real-world systems. By blending combinatorics, set theory, and graph theory, the authors have created a robust framework for addressing uncertainty in both mathematical systems and their real-world applications. This foundation sets the stage for future breakthroughs in combinatorics, set theory, and related fields. Each chapter in this volume contributes both theoretical foundations and practical applications, demonstrating the power of integrating graph theory, set theory, and uncertainty models. The new ideas, algorithms, and mathematical tools presented here will drive the future of combinatorial research and its applications in uncertain environments. In the first chapter, “Introduction to Upside-Down Logic: Its Deep Relation to Neutrosophic Logic and Applications”, the authors present Upside-Down Logic, a novel logical framework that systematically transforms truths into falsehoods and vice versa, based on contextual shifts. Introduced by F. Smarandache, this paper provides a mathematical definition of Upside-Down Logic, including applications related to the Japanese language. The chapter also introduces Contextual Upside-Down Logic, an extension that adjusts logical connectives alongside flipped truth values, as well as Indeterm-Upside-Down Logic and Certain Upside-Down Logic to address indeterminacy. A simple algorithm is also proposed to demonstrate the computational aspects of this logic. In the second chapter, “Local-Neutrosophic Logic and Local-Neutrosophic Sets: Incorporating Locality with Applications”, the authors introduce Local-Neutrosophic Logic and Local-Neutrosophic Sets, which integrate the concept of locality into Neutrosophic Logic. By defining locality as the influence of immediate surroundings on an object or system, this chapter explores how it affects indeterminacy in real-world problems. The paper also examines potential applications and provides mathematical definitions for these new concepts. The third chapter, “A Review of Fuzzy and Neutrosophic Offsets: Connections to Some Set Concepts and Normalization Function”, extends the concept of offsets in uncertain set-theoretic frameworks, such as Fuzzy Sets, Neutrosophic Sets, and Plithogenic Sets. This chapter introduces several advanced types of offsets, including Nonstationary Fuzzy Offset, Multi-valued Plithogenic Offset, and Subset-valued Neutrosophic Offset, offering deeper insights into handling uncertainty in mathematical models. In the fourth chapter, “Review of Plithogenic Directed, Mixed, Bidirected, and Pangene OffGraph”, the authors build upon Plithogenic Graphs to propose extensions such as Plithogenic Directed OffGraph, Plithogenic BiDirected OffGraph, and Plithogenic Mixed OffGraph. These new concepts, including the Plithogenic Pangene OffGraph, are explored in detail, with a focus on their mathematical properties and potential applications in uncertain graph theory. The fifth chapter, “Short Note on Neutrosophic Closure Matroids”, explores the extension of matroid concepts into Neutrosophic and Turiyam Neutrosophic set theories, introducing Neutrosophic closure matroids. This concept integrates uncertainty, indeterminacy, and liberal states into matroid theory, enhancing its applicability in optimization and combinatorial problems. In the sixth chapter, “Some Graph Parameters for Superhypertree-width and Neutrosophic Tree-width”, the authors discuss graph parameters such as Superhypertree-width and Neutrosophic tree-width. These parameters play a crucial role in the study of graph characteristics, particularly in algorithms and real-world applications. The chapter explores the generalization of hypergraphs to SuperHyperGraphs and examines how these concepts extend tree-width parameters within the context of Neutrosophic logic. (shrink)

Neutrosophic theory and its applications have been expanding in all directions at an astonishing rate especially after of the introduction the journal entitled “Neutrosophic Sets and Systems”. New theories, techniques, algorithms have been rapidly developed. One of the most striking trends in the neutrosophic theory is the hybridization of neutrosophic set with other potential sets such as rough set, bipolar set, soft set, hesitant fuzzy set, etc. The different hybrid structures such as rough neutrosophic set, (...) single valued neutrosophic rough set, bipolar neutrosophic set, single valued neutrosophic hesitant fuzzy set, etc. are proposed in the literature in a short period of time. Neutrosophic set has been an important tool in the application of various areas such as data mining, decision making, e-learning, engineering, medicine, social science, and some more. (shrink)

Road link speed is one of the important indicators for traffic states. In order to incorporate the spatiotemporal dynamics and correlation characteristics of road links into speed prediction, this paper proposes a method based on LDA and GCN. First, we construct a trajectory dataset from map-matched GPS location data of taxis. Then, we use the LDA algorithm to extract the semantic function vectors of urban zones and quantify the spatial dynamic characteristics of road links based on taxi trajectories. Finally, we (...) add semantic function vectors to the dataset and train a graph convolutional network to learn the spatial and temporal dependencies of road links. The learned model is used to predict the future speed of road links. The proposed method is compared with six baseline models on the same dataset generated by GPS equipped on taxis in Shenzhen, China, and the results show that our method has better prediction performance when semantic zoning information is added. Both composite and single-valued semantic zoning information can improve the performance of graph convolutional networks by 6.46% and 8.35%, respectively, while the baseline machine learning models work only for single-valued semantic zoning information on the experimental dataset. (shrink)

In this paper we introduce the concept of interval valued neutrosophic soft topological space together with interval valued neutrosophic soft finer and interval valued neutrosophic soft coarser topology. We also define interval valued neutrosophic interior and closer of an interval valued neutrosophic soft set. Some theorems and examples are cites. Interval valued neutrosophic soft subspace topology are studied. Some examples and theorems regarding this concept are presented.

In this research article, we presented the idea of intuitionistic fuzzy incidence graphs along with their certain properties. The number of operations including Cartesian product, composition, tensor product, and normal product in an IFIGs are also investigated. The method to compute the degree of IFIGs obtained by CP, composition, tensor product, and the normal product is discussed. Some important theorems to calculate the degree of the vertices of IFIGs acquired by CP, composition, tensor product, and normal product are elaborated. (...) An application of CP and composition of two IFIGs in the textile industry to find the best combinations of departments expressing the highest percentage of progress and the lowest percentage of nonprogress is provided. A comparative analysis of our study with the existing study is discussed. Our study will be beneficial to comprehend and understand the further characteristics of IFIGs in detail. Another advantage of our study is that it will be helpful to find the maximum percentage of progress and minimum percentage of nonprogress in different departments of universities, garment factories, and hospitals. (shrink)

In this paper, we first defined soft intervalvalued neutrosophic rough sets(SIVN- rough sets for short) which combines interval valued neutrosophic soft set and rough sets and studied some of its basic properties. This concept is an extension of soft interval valued intuitionistic fuzzy rough sets( SIVIF- rough sets). Finally an illustartive example is given to verfy the developped algorithm and to demonstrate its practicality and effectiveness.

It is shown that the Born Rule probabilities, i.e. the squares of the moduli of the coefficients in a pure state superposition, refer to mutually exclusive events consequent on measurement. It is also shown that the eigenstates in a pure state superposition are not mutually exclusive events. If the Born Rule is to be retained as the fundamental interpretative postulate of quantum mechanics then it follows, firstly, that the probabilities necessarily refer not to the eigenstates but to the eigenvalues to (...) which the eigenstates belong and, secondly, that the eigenvalues are necessarily mutually exclusive events. This means that to ask why a measurement of an observable on a system in a pure state superposition of eigenstates yields a single state rather than all the states in the superposition is to ill-pose the quantum measurement problem. The events the Born Rule probabilities properly refer to are not states but values. And it also means that the correctly-posed measurement problem, why does a measurement of an observable in a pure state superposition of the eigenstates of the observable yield a single eigenvalue rather than all the eigenvalues implicit in the superposition, admits of the answer: the values, being mutually exclusive events, constitute a statistical mixture of values, and as such, a measurement will yield just one of them. (shrink)

Studies to neutrosophic graphs happens to be not only innovative and interesting, but gives a new dimension to graph theory. The classic coloring of edge problem happens to give various results. Neutrosophic tree will certainly find lots of applications in data mining when certain levels of indeterminacy is involved in the problem. Several open problems are suggested.