APAV - Academy of Sciences, Letters, Arts and Technology (E-Journals)
Not a member yet
757 research outputs found
Sort by
Translations of Bipolar Valued Multi Fuzzy Subnearring of a Nearring
In this paper, some translations of bipolar valued multi fuzzy subnearring of a nearing are introduced and using these translations, some theorems are stated and proved
Modular Coloring and Switching in Some Planar Graphs
For a connected graph G, let c: V (G) →ℤk (k ≥ 2) be a vertex coloring of G. The color sum \sigma(v) of a vertex v of G is defined as the sum in ℤk of the colors of the vertices in N (v) that is (v) = \sum_{u\inN(v)}{c(u)} (mod k). The coloring c is called a modular k-coloring of G if ????(x) ≠ ????(y) in ℤk for all pairs of adjacent vertices x, y \in\ G. The modular chromatic number or simply the mc-number of G is the minimum k for which G has a modular k-coloring. A switching graph is an ordinary graph with switches. For many problems, switching graphs are a remarkable straight forward and natural model, but they have hardly been studied. A vertex switching Gv of a graph G is obtained by taking a vertex V of G, removing the entire edges incident with V and adding edges joining V to every vertex which are not adjacent to V in G. In this paper we determine the modular chromatic number of Wheel graph, Friendship graph and Gear graph after switching on certain vertices. Here, we first define switching of graphs. Next, we investigating several problems on finding the mc(G) after switching of graphs and provide their characterization in terms of complexity
Algorithm Approaches for Shortest Path Problem in an Interval - Valued Triangular Pythagorean Fuzzy Network
It has been proposed to use Pythagorean fuzzy sets (PFS), is an extension of fuzzy sets (FSs), to address uncertainty in practical decision– making problems. Then the Shortest Path Problem (SPP) is a well– known network improvement issue with numerous practical applications. Then the shortest Path (SP) and the shortest distance (SD)in an Interval – valued Pythagorean fuzzy graph (I-VPFG) are foundusing a method in the current communication. Nodes and connections are crisp, while the edge weights are I-V triangular Pythagoreanfuzzy numbers (I-VTPFN). Additionally, a numerical example hasbeen used to demonstrate the suggested strategy
Isolate g-eccentric domination in fuzzy graph
In a fuzzy graph G(ρ, μ), a dominating set D ⊆ P(G) is said to be g-eccentric if at least one g-eccentric vertex a of every vertex b in P − D exists in D. If the induced fuzzy sub graph has at least one isolated vertex, then a g-eccentric dominating set D of G is said to be an isolate g-eccentric dominating set. The isolate g-eccentric domination number is defined as the smallest cardinality over all isolate g-eccentric dominating sets of G. This article introduces the isolate g-eccentric point set, isolate g-eccentric dominating set, and their numbers in fuzzy graphs. In some standard fuzzy graphs, bounds are found for an isolate g-eccentric domination number
The concept of probability, crisis in statistics, and the unbearable lightness of Bayesing
Education in statistics, the application of statistics in scientific research, and statistics itself as a scientific discipline are in crisis. Within science, the main cause of the crisis is the insufficiently clarified concept of probability. This article aims to separate the concept of probability which is scientifically based from other concepts that do not have this characteristic. The scientifically based concept of probability is Kolmogorov’s concept of probability models together with the conditions of their applicability. Bayesian statistics is based on the subjective concept of probability, and as such can only have a heuristic value in searching for the truth, but it cannot and must not replace the truth. The way out of the crisis should take Kolmogorov and Bayesian analysis as elements, each of which has a well-defined and limited use. Only together with qualitative analysis and other types of quantitative analysis, and combined with experiments, they can contribute to reaching correct conclusions
Social capital in chronic disease: an ethnographic study
Chronically ill conditions are particularly difficult to manage because of their impact both on the social and on the corporal sphere to such an extent as to involve a series of problems that negatively alter the quality of life of affected patients. Chronicity has also a considerable ef-fect on social capital. In the current literature, it is known that social capital may contribute to a range of advantages to people health. Chronic Venous Disease (CVD) includes several pathologi-cal alterations of the venous system of the lower limbs that cause a wide range of symptoms and signs. The aim of this study is to explore, with a qualitative approach, the dynamics of social cap-ital within people's experience of CVD and describe the roles of family and friends and the health care system. The method used is based on face-to-face semistructured interviews was performed, following the Consolidated Criteria for Reporting Qualitative Research (COREQ) checklist. Six-teen patients were included: 11 women and 5 men. The results obtained are completely in line with the current literature, which shows a certain difficulty in terms of daily activities, pain management; work-related difficulties; non-coverage of healthcare costs for medications and drugs prescribed. In the context of social capital, the bonding social capital of the patients inter-viewed was more positively perceived in the role of CVD management than by the patients' fami-lies. Another interesting result concerns the total absence of knowledge of patient associations with CVD. Thus, alongside the biographical destruction that CVD entails, there is evidence of the scarce relevance and presence of health policies capable of improving the quality of life of these people not only from a social and medical point of view but also from an economic point of vie
Anti-Adjacency Matrices of Certain Graphs Derived from Some Graph Operations
If we go through the literature, one can find many matrices that are derived for a given simple graph. The one among them is the anti-adjacency matrix which is given as follows; The anti-adjacency matrix of a simple undirected graph with vertex set is an matrix , where if there exists an edge between and and otherwise. In this paper, we try to bring out an expression, which establishes a connection between the anti-adjacency matrices of the two graphs and and the anti-adjacency matrix of their tensor product, . In addition, an expression for the anti-adjacency matrix of the disjunction of two graphs, , is obtained in a similar way. Finally, we obtain an expression for the anti-adjacency matrix for the generalized tensor product and generalized disjunction of two graphs. Adjacency and anti-adjacency matrices are square matrices that are used to represent a finite graph in graph theory and computer science. The matrix elements show whether a pair of vertices in the graph are adjacent or not
Antimagic Labeling of Some Degree Splitting Graphs
A graph with q edges is called antimagic if its edges can be labeled with 1, 2, 3, ..., q without repetition such that the sums of the labels of the edges incident to each vertex are distinct. As Wang et al. [2012], proved that not all graphs are antimagic, it is interesting to investigate antimagic labeling of graph families. In this paper we discussed antimagic labeling of the larger graphs obtained using degree splitting operation on some known antimagic graphs. As discussed in Krishnaa [2016], antimagic labeling has many applications, our results will be used to expand the network on larger graphs
Theoretical Analysis on the Growth Kinetics of SARS-CoV (within host)
A mathematical model is investigated to analyze the biological interactionsbetween the immune system and SARS-CoV (within host).Homotopy Perturbation Method is executed to obtain an analyticalsolution to the non-linear system of ordinary differential equations.Graphical illustration to these solutions is also presented. The reliabilityand the simplicity of the aforementioned method is studiedthrough the comparison between the numerical and graphical results.This comparison aids the better understanding of the disease dynamicsand also the establishment of probable strategies for the treatmentof COVID-19
Inventory model with preservation technology and exponential holding cost in fuzzy scenario
Inventories are ubiquitous in the business sector. Since inventory is most frequently incurring expense, stock control is critical for an organization and it must be scrimping and saving in contemplation of function the merchandising fruitfully. In this paper, an inventory model for a deteriorating item under exponential holding cost with collaborative preservation technology investment under carbon policy is considered. Also, this study is developed in a fuzzy scenario by employing triangular fuzzy numbers. Signed distance method is utilized to enhance decision making and optimization. Further the convexity of the total cost function for both the crisp and the fuzzy case is established. The objective is to determine the optimal investment in preservation technology and the optimal cycle length so as to minimize the total cost. Moreover, some managerial results are obtained by using sensitivity analysis and graphical representation is also carried out. The applications of the proposed model is used in the fields of constructing machinery or heavy duty construction equipment, specific chemicals and processed food.