Search

Face-on-Face interaction constitutes an integral part of the classroom atmosphere as it provides teachers with an opportunity to understand their students intimately. Hence, this study deals with attribute based double bounded rough neutrosophic set driven random forests using Gini Impurity based split to arrive at a decision regarding the teaching-learning efficiency. A mathematical model is constructed using double bounded rough neutrosophic set which is utilised to evaluate the expression of the students with the help of a real-time data by capturing the images of the students against different subjects. The decisions made are then used to fit a random forest model to establish inferences regarding the teaching-learning efficiency for different subjects. The constructed model is then validated using newly added test objects.

By using neutrosophic m-alpha closed sets in neutrosophic topological spaces, we introduce the space known as neutrosophic t-alpha space in this paper. We also introduce the mappings referred as neutrosophic m-alpha continuous functions, homeomorphisms, and connectedness, and we research the characterizations and their properties.

In this paper we have successfully constructed the literal neutrosophic Kumaraswamy probability distribution. We mean by literal neutrosophic probability distribution that parameters of the distribution and the values that the random variable describing the distribution all take literal neutrosophic numbers of the form 𝜃𝑁 = 𝑎+𝑏𝐼 ; 𝐼2 = 𝐼 which differs from interval-valued neutrosophic probability distributions in which parameters of theses distributions take the form 𝜃𝑁 ∈ [𝐿, 𝑈]. We have derived the neutrosophic form of the probability density function, cumulative distribution function, statistical properties and maximum likelihood estimations of the parameters. Finally, a simulation study is performed to show the efficiency of the estimators provided by the neutrosophic MLE method.

In this paper, the concept of inverse domination in neutrosophic graph is established. The definition of inverse domination number, inverse dominating set, inverse split and non split dominating sets in neutrosophic graph are developed with suitable examples here. Also, the theorems in inverse domination in neutrosophic graph and the bound on inverse domination number in neutrosophic graph are derived.

This article exceedingly induces a completely new impression of graded mean integral representation in trapezoidal neutrosophic number domain corresponding to each membership function. Furthermore employing these integral representations, a new fangled graded mean integral distance measure is produced between two trapezoidal neutrosophic numbers. Notably, a numerical business economy based Multi Criteria Decision Making (MCDM) problem is fabricated along with the explication of neutrosophic theory to authenticate our suggested course of action in the decision making policy with the prominent solution scheme of VlseKriterijumska Optimizcija I Kaompromisno Resenje (VIKOR) technique for recognising the best alternative from a finite set. Lastly, the comparison work acts as an additional encouragement of our proposed scheme.

The article considers a new generalization of closed sets in neutrosophic topological space. This generalization is called Neutrosophic gsg-closed set. Moreover, we discuss its essential features in neutrosophic topological spaces. Furthermore, we extend the research by displaying new related definitions such as neutrosophic gsg-closure and neutrosophic gsg-interior and debating their powerful characterizations and relationships.

The current study shows the study of NeutroBitopological Space. In this work, the properties of NeutroBitopological Space are discussed. It is seen that many properties do not coincide with the properties of general Bitopological space. The terms NeutroInterior, NeutroClosure, and NeutroBoundary are defined with examples also their properties are observed.

The concept of neutrosophic sets makes it easier to analyse values that are ambiguous or indeterminate. We illustrate the concept of single-valued neutrosophic R-dynamic vertex coloring in this study. In addition, the single valued neutrosophic dynamic vertex coloring of the Cartesian product of path with cycle, cycle with cycle, complete SVNG with complete SVNG and cycle has been determined. Also, we have discussed the single valued neutrosophic dynamic vertex coloring of join of complete SVNG with complete SVNG and cycle, cycle with cycle.

The COVID-19 pandemic has affected the presence of students in the classroom, especially in medical schools where the practice is essential to gain skills. Virtual teaching or e-learning has emerged as the answer to that problem in this environment. Despite its many advantages, this process has faced different problems that have been overcome thanks to success factors. Considering the need to search for quality in medical schools in Ecuador, a study was carried out on those applied factors that have contributed to guaranteeing the quality of the teaching-learning process. That is the main objective of this research, supported by the bibliographic search and Plithogeny. It can be concluded that the highest level of impact has been made possible by the combination of the correct use of Information and Communication Technologies with adequate teacher training.

During the production process, production companies need to monitor the finished products and ensure their quality, which imposes on them the appointment of inspectors for auditing, and this appointment costs the company amounts that affect the general profit, so it strives to make this cost as low as possible and that the audit process is carried out with high accuracy because in case that the finished products do not conform to the basic specifications of the product, the company is required to pay a fine. In this research, we will formulate the text of the problem appropriately for such a case and then we will build the appropriate mathematical model through which we can obtain the lowest possible cost of inspection, and we will present the study using classical values and neutrosophic values, and we will demonstrate them through an example that shows us the difference between them.

Piping systems tend to malfunction when a set parameter goes off the mark. The parameters which directly affect the structure and working of a pump piping system are known as critical factors. The processes influenced by these factors and consequently the underlying cause of failure have been thoroughly investigated through research. The interrelationship between them, however, remains a mystery. The ability of the plant supervisor or worker to combine their vast theoretical knowledge with actual data will be enhanced by exposing these cause-effect correlations among the problems commonly encountered in pump piping systems. The SVN DEMATEL (Decision-Making Trial-andEvaluation Laboratory) approach is used in this study to determine the predominant causes of pump piping system failures. By considering a group of expert perspectives to create a cause-and-effect relationship diagram, the DEMATEL approach allows one to determine and assess the most significant element. SVN sets in DEMATEL, likewise, eliminate uncertainty when making conclusions concerning failure relationships from the judgements provided by experts [1]. The focus of the failure analysis was divided into six groups: selection of pump, design of pump, construction, operation/maintenance, piping errors and commissioning of the system. A total of 26 factors were identified and were assigned to a relevant group. Each factor was further categorized into four levels based on the degree of influence using the methodology presented in this study. It was found that “Temperature” has the highest degree of influence over the other criteria whereas criteria like “Pressure” and “Power Supply” tend to be influenced by other factors. The proposed SVN-DEMATEL method would be suitable for qualitative analysis of different industrial systems.

It can be difficult to figure out how to satisfy customers’ ever rising demands and keep up one’s market competitiveness while containing controllable costs. Inefficiencies in the supply chain network are thus discovered by our investigation. Finding the best allocation order for products from diverse sources going to numerous destinations is the primary objective. Moreover, The information that is readily available is typically not clear-cut in real-world circumstances. So, it gives rise to the uncertain transportation problem. With the aim of helping the decision maker to have the suitable transportation plan with real suitation, in this paper, a solution procedure for multi objective transportation problem involving uncertainvariables has been studied under neutrosophic environment. A chance constraint model is constructed foruncertain multi objective transportation problem and then a neutrosophic compromise approach is used toobtain the pareto optimal solution for the problem. As neutrosophic sets are built with truth, indeterminacyand falsity membership functions, they are capable to help the decision maker in this complex transportation model. A numerical example has been reported to demonstrate the efficiency of the proposed approach towardsthe best compromise solution and a comparison study has been made with the existing methods.

Vagueness and uncertainty are two distinct models are represented by Fuzzy sets and Soft sets. The combination of Soft sets and simple graphs produces soft graphs which is also an interesting concept to deal with uncertainty problems. Any communication network can be modeled as a graph whose nodes are the processors (stations) and a communication link as an edge between corresponding nodes. The stability of a communication network is a very important factor for the network designers to reconstruct the it after the failure of certain stations or communication links. Two essential quantities in an analysis of the vulnerability of a communication network are (1) the number of nodes that are not functioning and (2) the size of a maximum order of a remaining sub network within which mutual communications can still occur. C. A. Barefoot, et. al. [13] introduced the concept of integrity. The extension of such a vulnerability parameter is studied in fuzzy graphs. Since neutrosophic soft graphs are the most generalized network structure where we can define and study the importance of the vulnerability parameters is made in this manuscript. Also, we introduce the domination integrity of neutrosophic soft graphs and explain with suitable examples. Few bounds are obtained.

Neutrosophy deals with the study of neutrosophic logic, set and probability. A Pythagorean mpolar neutrosophic set is indeed an expansion of crisp, fuzzy, intuitionistic fuzzy, neutrosophic and Pythagorean m-polar fuzzy sets. In this paper, we develop the perception of Pythagorean m-polar fuzzy neutrosophic metric space defined over Pythagorean m-polar fuzzy neutrosophic set relying on the classical definition of metric spaces defined on a crisp set. We present some related results and illustrations to perceive the conceptions. We present many examples of metrics which hold true for classical sets but fail to make sense in Pythagorean m-polar fuzzy environment. We also render a practical utility of the proposed metrics in pattern recognition.

In this paper, the priority disciplined queuing models are investigated under neutrosophic environment. It develops and optimizes a model with non-preemptive priorities system, denoted by NM/NM/1. It is a queuing model where the arrivals follow a Poisson process, service times are exponentially distributed and there is only one server whose arrival rate and service rate are represented in terms of single valued trapezoidal Neutrosophic number (SVTNN). Using (α, β, γ)-cut approach and Zadehs extension principle, the Neutrosophic queuing model is reduced to a crisp model and results are discussed. An illustrative example is provided to understand the analytical procedure developed in this paper.

Currently most signalized intersections in almost all developing countries use fixed time traffic controllers or pre-timed traffic lights. But as a real life situation, in addition to uncertainty and impreciseness there is also indeterminacy in traffic signal control constraints due to various factors like unawareness of the problem, inaccurate and imperfect data and poor forecasting in addition to uncertainty in the constraints. To overcome these interval valued neutrosophic soft set traffic signal control model at four way isolated signalized intersections has been developed. The main aim of this research is to validate the IVNSS traffic signal control model and compare it with fixed time traffic signal control model using MATLAB simulation tool. Vehicle delay at the junction is used as a measure of effectiveness. The simulation is conducted for seven consecutive days from Monday up to Sunday for eight hours to reflect the different traffic flow conditions. The simulated delay model results are analysed under 5 different scenarios. And results showed that in case of heavy traffic conditions vehicle delay under IVNSS traffic signal control model is minimized by 36 percent and under light traffic conditions the average vehicle delay is minimized by 73 percent when compared to fixed time traffic signal control model.&nbsp

The quadripartitioned neutrosophic set is the partition of indeterminacy function of the neutrosophic set into contradiction part and ignorance part. In this work, the concept of quadripartitioned neutrosophic graph structures and its properties are invented. The strong, tree, 𝜙 − permutation and 𝜙 − complement of quadripartitioned neutrosophic graph structure are investigated. The operations like Cartesian Product, cross product, lexicographic product, composition in graph structures and join operations are established.&nbsp

The notion of neutrosophic algebra, ideal of neutrosophic algebra, kernel and neutrosophic quotient algebra have been proposed in this paper. We characterize some properties of neutrosophic algebra and proved that every quotient neutrosophic algebra is quotient algebra. Also we proved that every neutrosophic algebra is algebra and direct product of neutrosophic algebras over a neutrosophic field is algebra

This study included concepts for ($, ε, ς)-single valued neutrosophic hyperring (($, ε, ς)-SV NHR) and ($, ε, ς)-single valued neutrosophic hyperideal (($, ε, ς)-SV NHI). ($, ε, ς)-single valued neutrosophic hyperrings (($, ε, ς)-SV NHRs) and ($, ε, ς)-single valued hyperideals (($, ε, ς)-SV NHIs) are examined and validated in terms of algebraic features and of structural characteristics.

In this paper, we have introduced the concept of nk#Nα (n1 ) by using CLN α({n1}) where n1∈ N via Nα-open sets. Also, we have introduced the spaces called Nψα# 0-space and Nψα# 1-space.

Routers steer and bid network data, through packets that hold a variety of categories of data such as records, messages, and effortless broadcasts like web interfaces. The procedure of choosing a passageway for traffic in a network or between several networks is called routing. Starting from telephone networks to public transportation the principles of routing are applied. Routing is the higher-level decision-making that directs network packets from their source en route for their destination through intermediate network nodes by specific packet forwarding mechanisms. The main function of the router is to set up optimized paths among the different nodes in the network. An efficient novel routing algorithm is proposed with the utilization of neutrosophic fuzzy logic in this work addition to many routing algorithms for finding the optimal path in the literature. In this approach, each router makes its own routing decision in the halting time. Various concepts like routing procedures, most expected vector, most expected object, and list of estimated delays are explained.

The notion of neutrosophic sets facilitates the analysis of values that are unclear or indeterminate. In this paper, we discuss the single-valued neutrosophic R-dynamic vertex coloring of the Cartesian product of SVNG’sand join of SVG's. Further, we have described the concept of single-valued neutrosophic R-dynamic edge coloring and provided some examples and theorems.

This paper introduced the concept of neutrosophic multi topological space. The definitions of the interior, closure, exterior, and boundary of neutrosophic multiset is defined and also, its propositions will be studied with examples.

The aim of this paper is to develop many characterizations of Pentapartitioned Neutrosophic Pythagorean (PNP) strongly irresolvable spaces and its properties is also studied. Several characterizations of Pentapartitioned Neutrosophic Pythagorean strongly irresolvable spaces are investigated in this study. Also examined are the conditions under which Pentapartitioned Neutrosophic Pythagorean strongly irresolvable spaces become Pentapartitioned Neutrosophic Pythagorean first category spaces, Pentapartitioned Neutrosophic Pythagorean Baire spaces, and Pentapartitioned Baire spaces.

In this article the notion of two quadripartitioned single valued weighted dombi prioritized operators, namely, quadripartitioned single valued weighted dombi prioritized average (QSVNWDPA) operator and quadripartitioned single valued weighted dombi prioritized geometric ( QSVNWDPG) operator have been developed which are based on quadripartitioned single valued neutrosophic (QSVN) sets. Further some important properties of these two operators are studied. Finally a multi-attribute decision making (MADM) problem has been solved using QSVNWDPA operator and QSVNWDPG operator.

Let ���� = (U, V) be a Single valued Neutrosophic graph. A subset ���� ��� ����(����) is a said to be score equitable set if the score value of any two nodes in S differ by at most one. That is, |����(����)��� ����(����)| ��� 1, ����, ���� ��� ����. If e is an edge with end vertices u and v and score of u is greater than or equal to score of v then we say u strongly dominates v. If every vertex of V ��� S is strongly influenced by some vertex of S then S is called strong score set of G. The minimum cardinality of a strong dominating set is called the strong score number of G. The equitable integrity of Single valued Neutrosophic graph G which is defined as E����(����) = ������������{|����| + ����(���� ��� ���� ): ���� is a score equitable set in ����}, where ����(���� ��� ����) denotes the order of the largest component in ���� ��� ����. The strong integrity of Single valued Neutrosophic graph G which is defined as S����(����) = ������������{|����| + ����(���� ������� ): ���� is a strong score set in ����}. In this paper, we study the concepts of equitable integrity and strong equitable integrity in different classes of regular Neutrosophic graphs and discussed the upper and lower bounds