T-MBJ NEUTROSOPHIC SET UNDER M-SUBALGEBRA

In this paper, the idea of T-MBJ neutrosophic set is introduced in which MBJ-neutrosophic set is used to present this new set called T-MBJ neutrosophic set. furthermore the notion of T-MBJ neutrosophic M- subalgebra on G-algebra is also introduced and provide the conditions for T-MBJ neutrosophic M-subalgebra. The word M in the term M-subalgebra, represents the initial of author's rst name Mohsin. We study the T-MBJ neutrosophic set through dierent characteristics and also prove some results for better understanding of newly dene T-MBJ neutrosophic set

A new characterization of fuzzy ideals of semigroups and its applications

In this paper, we develop a new technique for constructing fuzzy ideals of a semigroup. By using generalized Green\u27s relations, fuzzy star ideals are constructed. It is shown that the new fuzzy ideal of a semigroup can be used to investigate the relationship between fuzzy sets and abundance and regularity for an arbitrary semigroup. Appropriate examples of such fuzzy ideals are given in order to illustrate the technique. Finally, we explain when a semigroup satisfies conditions of regularity

Discrete Mathematics and Symmetry

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

Algebraic Structures of Neutrosophic Triplets, Neutrosophic Duplets, or Neutrosophic Multisets

Neutrosophy (1995) is a new branch of philosophy that studies triads of the form (, , ), where is an entity {i.e. element, concept, idea, theory, logical proposition, etc.}, is the opposite of , while is the neutral (or indeterminate) between them, i.e., neither nor .Based on neutrosophy, the neutrosophic triplets were founded, which have a similar form (x, neut(x), anti(x)), that satisfy several axioms, for each element x in a given set.This collective book presents original research papers by many neutrosophic researchers from around the world, that report on the state-of-the-art and recent advancements of neutrosophic triplets, neutrosophic duplets, neutrosophic multisets and their algebraic structures – that have been defined recently in 2016 but have gained interest from world researchers. Connections between classical algebraic structures and neutrosophic triplet / duplet / multiset structures are also studied. And numerous neutrosophic applications in various fields, such as: multi-criteria decision making, image segmentation, medical diagnosis, fault diagnosis, clustering data, neutrosophic probability, human resource management, strategic planning, forecasting model, multi-granulation, supplier selection problems, typhoon disaster evaluation, skin lesson detection, mining algorithm for big data analysis, etc