Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Number Theory (9)
- Algebraic Geometry (8)
- Logic and Foundations (8)
- Algebra (7)
- Analysis (6)
-
- Applied Mathematics (6)
- Discrete Mathematics and Combinatorics (6)
- Geometry and Topology (5)
- Set Theory (4)
- Computer Engineering (1)
- Computer Sciences (1)
- Digital Communications and Networking (1)
- Engineering (1)
- OS and Networks (1)
- Other Applied Mathematics (1)
- Other Computer Engineering (1)
- Other Computer Sciences (1)
- Other Statistics and Probability (1)
- Probability (1)
- Statistics and Probability (1)
- Keyword
-
- Neutrosophic logic (4)
- Mathematics (3)
- Supermathematics (2)
- Circle (1)
- Classical geometry (1)
-
- Classical geometry of the circle (1)
- Complete single valued neutrosophic graph (1)
- Constant single valued neutrosophic graph (1)
- Degree of membership (1)
- Dijkstra’s algorithm; Single valued neutrosophic number; Shortest path problem; Network (1)
- Ex-centric circular supermathematics functions (1)
- Geometry (1)
- Graph theory (1)
- Luhn primes (1)
- MOD function (1)
- MOD limit cycle (1)
- MOD planes (1)
- MOD rectangular matrices (1)
- Mathematical problems (1)
- Neutrosophic measure (1)
- Neutrosophic overset (1)
- Neutrosophic probability (1)
- Neutrosophy (1)
- Normalized neutrosophic probability (1)
- PCR5 (1)
- Prime series (1)
- Problems (1)
- Science communication (1)
- Science lab (1)
- Scientific communication (1)
Articles 1 - 16 of 16
Full-Text Articles in Other Mathematics
Computation Of Shortest Path Problem In A Network With Sv-Trapezoidal Neutrosophic Numbers, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea, Luige Vladareanu
Computation Of Shortest Path Problem In A Network With Sv-Trapezoidal Neutrosophic Numbers, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea, Luige Vladareanu
Branch Mathematics and Statistics Faculty and Staff Publications
In this work, a neutrosophic network method is proposed for finding the shortest path length with single valued trapezoidal neutrosophic number. The proposed algorithm gives the shortest path length using score function from source node to destination node. Here the weights of the edges are considered to be single valued trapezoidal neutrosophic number. Finally, a numerical example is used to illustrate the efficiency of the proposed approach
Single Valued Neutrosophic Graphs, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea
Single Valued Neutrosophic Graphs, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea
Branch Mathematics and Statistics Faculty and Staff Publications
The notion of single valued neutrosophic sets is a generalization of fuzzy sets, intuitionistic fuzzy sets. We apply the concept of single valued neutrosophic sets, an instance of neutrosophic sets, to graphs. We introduce certain types of single valued neutrosophic graphs (SVNG) and investigate some of their properties with proofs and examples.
Strong Neutrosophic Graphs And Subgraph Topological Subspaces, Florentin Smarandache, W.B. Vasantha Kandasamy, Ilantheral K
Strong Neutrosophic Graphs And Subgraph Topological Subspaces, Florentin Smarandache, W.B. Vasantha Kandasamy, Ilantheral K
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors for the first time introduce the notion of strong neutrosophic graphs. They are very different from the usual graphs and neutrosophic graphs. Using these new structures special subgraph topological spaces are defined. Further special lattice graph of subgraphs of these graphs are defined and described. Several interesting properties using subgraphs of a strong neutrosophic graph are obtained. Several open conjectures are proposed. These new class of strong neutrosophic graphs will certainly find applications in NCMs, NRMs and NREs with appropriate modifications.
Problems On Mod Structures, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Problems On Mod Structures, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors for the first time give several types of problems on MOD structures happens to be an interesting field of study as it makes the whole 4 quadrant plane into a single quadrant plane and the infinite line into a half closed open interval. So study in this direction will certainly yield several interesting results. The law of distributivity is not true. Further the MOD function in general do not obey all the laws of integration or differentiation. Likewise MOD polynomials in general do not satisfy the basic properties of polynomials like its roots etc. Thus over …
Nidus Idearum. Scilogs, I: De Neutrosophia, Florentin Smarandache
Nidus Idearum. Scilogs, I: De Neutrosophia, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
Welcome into my scientific lab! My lab[oratory] is a virtual facility with noncontrolled conditions in which I mostly perform scientific meditation and chats: a nest of ideas (nidus idearum, in Latin). I called the jottings herein scilogs (truncations of the words scientific, and gr. Λόγος – appealing rather to its original meanings "ground", "opinion", "expectation"), combining the welly of both science and informal (via internet) talks (in English, French, and Romanian). In this first books of scilogs collected from my nest of ideas, one may find new and old questions and solutions, some of them already put at work, others …
Nidus Idearum. Scilogs, Ii: De Rerum Consectatione, Florentin Smarandache
Nidus Idearum. Scilogs, Ii: De Rerum Consectatione, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
Welcome into my scientific lab! My lab[oratory] is a virtual facility with noncontrolled conditions in which I mostly perform scientific meditation and chats: a nest of ideas (nidus idearum, in Latin). I called the jottings herein scilogs (truncations of the words scientific, and gr. Λόγος – appealing rather to its original meanings "ground", "opinion", "expectation"), combining the welly of both science and informal (via internet) talks (in English, French, and Romanian). In this second book of scilogs collected from my nest of ideas, one may find new and old questions and solutions, some of them already put at work, others …
Mathematics. Possible Subjects For The High School Entrance Examination And The Capacity Examination In Romania, Florentin Smarandache, Constantin Coanda, Ionuț Ivanescu
Mathematics. Possible Subjects For The High School Entrance Examination And The Capacity Examination In Romania, Florentin Smarandache, Constantin Coanda, Ionuț Ivanescu
Branch Mathematics and Statistics Faculty and Staff Publications
The present book tries to offer students and teachers knowledge evaluation tools for all the chapters from the current Romanian mathematics syllabus. In the evolution of teenagers, the phase of admission in high schools mobilizes particular efforts and emotions. The present workbook aims to be a permanent advisor in the agitated period starting with the capacity examination and leading to the admittance to high school. The tests included in this workbook have a complementary character as opposed to the many materials written with the purpose to support all those who prepare for such examinations and they refer to the entire …
Pcr5 And Neutrosophic Probability In Target Identification, Florentin Smarandache, Nassim Abbas, Youcef Chibani, Bilal Hadjadji, Zayen Azzouz Omar
Pcr5 And Neutrosophic Probability In Target Identification, Florentin Smarandache, Nassim Abbas, Youcef Chibani, Bilal Hadjadji, Zayen Azzouz Omar
Branch Mathematics and Statistics Faculty and Staff Publications
In this paper we use PCR5 in order to fusion the information of two sources providing subjective probabilities of an event A to occur in the following form: chance that A occurs, indeterminate chance of occurrence of A, chance that A does not occur.
Sisteme Vibrante Trilobice, Florentin Smarandache, Mircea Eugen Selariu
Sisteme Vibrante Trilobice, Florentin Smarandache, Mircea Eugen Selariu
Branch Mathematics and Statistics Faculty and Staff Publications
No abstract provided.
Trilobic Vibrant Systems, Florentin Smarandache, Mircea Eugen Selariu
Trilobic Vibrant Systems, Florentin Smarandache, Mircea Eugen Selariu
Branch Mathematics and Statistics Faculty and Staff Publications
No abstract provided.
Luhn Primes Of Order Ω, Florentin Smarandache, Octavian Cira
Luhn Primes Of Order Ω, Florentin Smarandache, Octavian Cira
Branch Mathematics and Statistics Faculty and Staff Publications
A prime p, that added to its reverse results in a new prime is called a Luhn prime . The number 229 is a Luhn prime because 229 + 922 = 1151 and 1151 is also a prime . We extend the definition of Luhn primes, present some of the of their properties and ways to determine them .
Single Valued Neutrosophic Graphs: Degree, Order And Size, Florentin Smarandache, Said Broumi, Mohamed Talea, Assia Bakali
Single Valued Neutrosophic Graphs: Degree, Order And Size, Florentin Smarandache, Said Broumi, Mohamed Talea, Assia Bakali
Branch Mathematics and Statistics Faculty and Staff Publications
The single valued neutrosophic graph is a new version of graph theory presented recently as a generalization of fuzzy graph and intuitionistic fuzzy graph. The single valued neutrosophic graph (SVN-graph) is used when the relation between nodes (or vertices) in problems are indeterminate. In this paper, we examine the properties of various types of degrees, order and size of single valued neutrosophic graphs and a new definition for regular single valued neutrosophic graph is given.
Interval-Valued Neutrosophic Oversets, Neutrosophic Undersets, And Neutrosophic Offsets, Florentin Smarandache
Interval-Valued Neutrosophic Oversets, Neutrosophic Undersets, And Neutrosophic Offsets, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
We have proposed since 1995 the existence of degrees of membership of an element with respect to a neutrosophic set to also be partially or totally above 1 (over-membership), and partially or totally below 0 (under-membership) in order to better describe our world problems [published in 2007].
Complements To Classic Topics Of Circles Geometry, Florentin Smarandache, Ion Patrascu
Complements To Classic Topics Of Circles Geometry, Florentin Smarandache, Ion Patrascu
Branch Mathematics and Statistics Faculty and Staff Publications
We approach several themes of classical geometry of the circle and complete them with some original results, showing that not everything in traditional math is revealed, and that it still has an open character. The topics were chosen according to authors’ aspiration and attraction, as a poet writes lyrics about spring according to his emotions.
Special Type Of Fixed Point Pairs Using Mod Rectangular Matrix Operators, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Special Type Of Fixed Point Pairs Using Mod Rectangular Matrix Operators, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors for the first time define a special type of fixed points using MOD rectangular matrices as operators. In this case the special fixed points or limit cycles are pairs which is arrived after a finite number of iterations. Such study is both new and innovative for it can find lots of applications in mathematical modeling. Since all these Zn or I nZ or 〈Zn ∪ g〉 or 〈Zn ∪ g〉I or C(Zn) or CI(Zn) are all of finite order we are sure to arrive at a MOD fixed point pair or a MOD limit cycle pair …
Applying Dijkstra Algorithm For Solving Neutrosophic Shortest Path Problem, Florentin Smarandache, Luige Vladareanu, Said Broumi, Assia Bakali, Muhammad Akram
Applying Dijkstra Algorithm For Solving Neutrosophic Shortest Path Problem, Florentin Smarandache, Luige Vladareanu, Said Broumi, Assia Bakali, Muhammad Akram
Branch Mathematics and Statistics Faculty and Staff Publications
The selection of shortest path problem is one the classic problems in graph theory. In literature, many algorithms have been developed to provide a solution for shortest path problem in a network. One of common algorithms in solving shortest path problem is Dijkstra’s algorithm. In this paper, Dijkstra’s algorithm has been redesigned to handle the case in which most of parameters of a network are uncertain and given in terms of neutrosophic numbers. Finally, a numerical example is given to explain the proposed algorithm.