Open Access. Powered by Scholars. Published by Universities.®

Other Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 6 of 6

Full-Text Articles in Other Mathematics

Neutrosophic N -Structures And Their Applications In Semigroups, Florentin Smarandache, Madad Khan, Saima Anis, Young Bae Jun Oct 2017

Neutrosophic N -Structures And Their Applications In Semigroups, Florentin Smarandache, Madad Khan, Saima Anis, Young Bae Jun

Branch Mathematics and Statistics Faculty and Staff Publications

The notion of neutrosophic N -structure is introduced, and applied it to semigroup. The notions of neutrosophic N -subsemigroup, neutrosophic N -product and ε-neutrosophic N -subsemigroup are introduced, and several properties are investigated. Conditions for neutrosophic N -structure to be neutrosophic N -subsemigroup are provided. Using neutrosophic N -product, characterization of neutrosophic N -subsemigroup is discussed. Relations between neutrosophic N -subsemigroup and εneutrosophic N -subsemigroup are discussed. We show that the homomorphic preimage of neutrosophic N -subsemigroup is a neutrosophic N - subsemigroup, and the onto homomorphic image of neutrosophic N - subsemigroup is a neutrosophic N -subsemigroup.


Neutrosophic N -Structures Applied To Bck/Bci-Algebras, Florentin Smarandache, Young Bae Jun, Hashem Bordbar Oct 2017

Neutrosophic N -Structures Applied To Bck/Bci-Algebras, Florentin Smarandache, Young Bae Jun, Hashem Bordbar

Branch Mathematics and Statistics Faculty and Staff Publications

Neutrosophic N -structures with applications in BCK/BC I-algebras is discussed. The notions of a neutrosophic N -subalgebra and a (closed) neutrosophic N -ideal in a BCK/BC I-algebra are introduced, and several related properties are investigated. Characterizations of a neutrosophic N -subalgebra and a neutrosophic N -ideal are considered, and relations between a neutrosophic N -subalgebra and a neutrosophic N -ideal are stated. Conditions for a neutrosophic N -ideal to be a closed neutrosophic N -ideal are provided.


Complex Neutrosophic Soft Set, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea, Mumtaz Ali, Ganeshsree Selvachandran Jul 2017

Complex Neutrosophic Soft Set, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea, Mumtaz Ali, Ganeshsree Selvachandran

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, we propose the complex neutrosophic soft set model, which is a hybrid of complex fuzzy sets, neutrosophic sets and soft sets. The basic set theoretic operations and some concepts related to the structure of this model are introduced, and illustrated. An example related to a decision making problem involving uncertain and subjective information is presented, to demonstrate the utility of this model.


Combinatorial Polynomial Hirsch Conjecture, Sam Miller Jan 2017

Combinatorial Polynomial Hirsch Conjecture, Sam Miller

HMC Senior Theses

The Hirsch Conjecture states that for a d-dimensional polytope with n facets, the diameter of the graph of the polytope is at most n-d. This conjecture was disproven in 2010 by Francisco Santos Leal. However, a polynomial bound in n and d on the diameter of a polytope may still exist. Finding a polynomial bound would provide a worst-case scenario runtime for the Simplex Method of Linear Programming. However working only with polytopes in higher dimensions can prove challenging, so other approaches are welcome. There are many equivalent formulations of the Hirsch Conjecture, one of which is the …


Complex Valued Graphs For Soft Computing, Florentin Smarandache, W.B. Vasantha Kandasamy, Ilanthenral K Jan 2017

Complex Valued Graphs For Soft Computing, Florentin Smarandache, W.B. Vasantha Kandasamy, Ilanthenral K

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time introduce in a systematic way the notion of complex valued graphs, strong complex valued graphs and complex neutrosophic valued graphs. Several interesting properties are defined, described and developed. Most of the conjectures which are open in case of usual graphs continue to be open problems in case of both complex valued graphs and strong complex valued graphs. We also give some applications of them in soft computing and social networks. At this juncture it is pertinent to keep on record that Dr. Tohru Nitta was the pioneer to use complex valued graphs …


Computation Of Shortest Path Problem In A Network With Sv-Triangular Neutrosophic Numbers, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea Jan 2017

Computation Of Shortest Path Problem In A Network With Sv-Triangular Neutrosophic Numbers, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea

Branch Mathematics and Statistics Faculty and Staff Publications

In this article, we present an algorithm method for finding the shortest path length between a paired nodes on a network where the edge weights are characterized by single valued triangular neutrosophic numbers. The proposed algorithm gives the shortest shortest path length from source node to destination node based on a ranking method. Finally, a numerical example is also presented to illustrate the efficiency of the proposed approach.