In the present paper, we will provide the lattice structure of the pessimistic multigranulation neutrosophic rough approximation operators. In particular, in the one-dimensional case, for special neutrosophic relations, the completely lattice isomorphic relationship between upper neutrosophic rough approximation operators and lower neutrosophic rough approximation operators is proved.

It is an interesting direction to study rough sets from a multi-granularity perspective. In rough set theory, the multi-particle structure was represented by a binary relation. This paper considers a new neutrosophic rough set model, multi-granulation neutrosophic rough set (MGNRS). First, the concept of MGNRS on a single domain and dual domains was proposed. Then, their properties and operators were considered. We obtained that MGNRS on dual domains will degenerate into MGNRS on a single domain when the two domains are the same. Finally, a kind of special multi-criteria group decision making (MCGDM) problem was solved based on MGNRS on dual domains, and an example was given to show its feasibility.

As a generalization of single value neutrosophic rough sets, the concept of multi-granulation neutrosophic rough sets was proposed by Bo et al., and some basic properties of the pessimistic (optimistic) multigranulation neutrosophic rough approximation operators were studied. However, they did not do a comprehensive study on the algebraic structure of the pessimistic (optimistic) multigranulation neutrosophic rough approximation operators. In the present paper, we will provide the lattice structure of the pessimistic multigranulation neutrosophic rough approximation operators. In particular, in the one-dimensional case, for special neutrosophic relations, the completely lattice isomorphic relationship between upper neutrosophic rough approximation operators and lower neutrosophic rough approximation operators is proved.

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 ideaof 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.

Some of the most beautiful studies in Mathematics are related to Symmetry and Geometry. For this reason, we select here some contributions about such aspects and Discrete Geometry. As we know, Symmetry in a system means invariance of its elements under conditions of transformations. When we consider network structures, symmetry means invariance of adjacency of nodes under the permutations of node set. The graph isomorphism is an equivalence relation on the set of graphs. Therefore, it partitions the class of all graphs into equivalence classes. The underlying idea of isomorphism is that some objects have the same structure if we omit the individual character of their components. A set of graphs isomorphic to each other is denominated as an isomorphism class of graphs. The automorphism of a graph will be an isomorphism from G onto itself. The family of all automorphisms of a graph G is a permutation group.

This book contains 37 papers by 73 renowned experts from 13 countries around the world, on following topics: neutrosophic set; neutrosophic rings; neutrosophic quadruple rings; idempotents; neutrosophic extended triplet group; hypergroup; semihypergroup; neutrosophic extended triplet group; neutrosophic extended triplet semihypergroup and hypergroup; neutrosophic offset; uninorm; neutrosophic offuninorm and offnorm; neutrosophic offconorm; implicator; prospector; n-person cooperative game; ordinary single-valued neutrosophic (co)topology; ordinary single-valued neutrosophic subspace; α-level; ordinary single-valued neutrosophic neighborhood system; ordinary single-valued neutrosophic base and subbase; fuzzy numbers; neutrosophic numbers; neutrosophic symmetric scenarios; performance indicators; financial assets; neutrosophic extended triplet group; neutrosophic quadruple numbers; refined neutrosophic numbers; refined neutrosophic quadruple numbers; multigranulation neutrosophic rough set; nondual; two universes; multiattribute group decision making; nonstandard analysis; extended nonstandard analysis; monad; binad; left monad closed to the right; right monad closed to the left; pierced binad; unpierced binad; nonstandard neutrosophic mobinad set; neutrosophic topology; nonstandard neutrosophic topology; visual tracking; neutrosophic weight; objectness; weighted multiple instance learning; neutrosophic triangular norms; residuated lattices; representable neutrosophic t-norms; De Morgan neutrosophic triples; neutrosophic residual implications; infinitely ∨-distributive; probabilistic neutrosophic hesitant fuzzy set; decision-making; Choquet integral; e-marketing; Internet of Things; neutrosophic set; multicriteria decision making techniques; uncertainty modeling; neutrosophic goal programming approach; shale gas water management system.

This is the third volume of the Encyclopedia of Neutrosophic Researchers, edited from materials offered by the authors who responded to the editor’s invitation. The authors are listed alphabetically. The introduction contains a short history of neutrosophics, together with links to the main papers and books.