APAV - Academy of Sciences, Letters, Arts and Technology (E-Journals)
Not a member yet
757 research outputs found
Sort by
Existence Results for ψ -Caputo Fractional Differential Equations with Boundary Conditions
Full text linkIn this paper, we examine the existence and uniqueness of arrangements of a limit esteem problem for a fractional differential equation of order α ∈ (2, 3), including a general type of fractional derivative. initially, we demonstrate a comparability between the Cauchy problem and the Volterra condition. Then, at that point, two outcomes on the existence of arrangements are demonstrated, and we end for certain illustrative models
Application of m- polar soft fuzzy bi- partite graph in residence selection process
Full text linkAn polar fuzzy set and soft sets are two different tools for representing uncertainty and vagueness. An polar soft fuzzy set is a mapping from parameter set to the polar fuzzy subsets of the universe. An polar soft fuzzy set theory provides a parameterized point of view for uncertainty modeling and soft computing model. In this paper, we have introduced the notions of polar soft fuzzy bipartite graph, size and degree of polar soft fuzzy bi-partite graph as well as an investigation on buying of residence by considering various parameters. People, while buying residence, have many options. So, to choose the best one, they have to consider many parameters. polar soft fuzzy graph is one of the major areas of graph theory, which finds a solution to this proble
Anti-Homomorphism in Q-Fuzzy Subgroups and Normal Subgroups
No full textMany researchers have explored the fuzzy set extensively. We propose the notion of anti-homomorphism in Q is fuzzy subgroups and normal subgroups. It is establish some findings in this study article and build the theory of anti-homomorphism in Q-fuzzy subgroups, normal subgroups. It is also extend results on Q-fuzzy abelian sub-group and Q-fuzzy normal subgroup
A Study on g**s-R_0 and g**s-R_1 Spaces in Topological Spaces
No full textIn this paper, we introduces the concept of R_0-space, R_1-space, door space, submaximal using {\hat{g}}^{\ast\ast}s-closed set and investigate its properties. We have also study their relationship with some other higher separation axioms. We have also, introduced a new definition S{\hat{g}}^\ast-space by using semi-closed and {\hat{g}}^\ast-closed sets and study its relationship with other closed sets using {\hat{g}}^{\ast\ast}s-closed set
Some New Odd prime Graphs
No full textFor a graph G, a bijection f is called an odd prime labeling , if ffrom V to f1; 3; 5; ::::; 2jV j - 1g for each edge uv in G the greatestcommon divisor of the labels of end vertices (f(u); f(v)) is one. Inthis paper we investigate the existence of odd prime labeling of somenew classes of graphs and we prove that the graphs such as the Z -Pngraph, Fish graph, Umbrella graph, Cocount tree , F-tree, Y -tree andDouble Sunflower graph are odd prime graphs
Pell Even Sum Cordial Labeling of Graphs
Full text linkLetG=(V,E) be a simple graph and let P_i be Pell numbers. For a bijectionf:V\left(G\right)\rightarrow{P_0,\ P_1,\ldots,P_{\left|V\right|-1}}, assign the label 1 for the edge e=uv if f\left(u\right)+f(v) is even and label 0 otherwise. Then f is said to be a Pell even sum cordial labeling of G if \left|e_f(0)-e_f(1)\right|\le1 where e_f(0) and e_f(1) denote the number of edges labeled with 0 and 1 respectively. If any graph admits Pell even sum cordial labeling, it is called Pell even sum cordial graph. In this study, we show that star, comb, bistar, jewel, crown, bipartite graph K_{m,m},\ flower graph, helm, wheel, triangular book, K_2+mK_1 are Pell even sum cordial
Group Fuzzy Languages and its Generalizations
Full text linkIn fuzzy language theory, every monoid is the syntactic monoid of some fuzzy language. By using this result the properties of fuzzy language can be studied by the algebraic properties of the syntactic monoids. There are so many methods for studying fuzzy languages. We adopt the above method to analyze different class of fuzzy languages and also characterize certain varieties of fuzzy languages. In this paper we give the variety description of group fuzzy languages and also provide the Eilenberg variety theorem for the class of group fuzzy languages. Moreover we described a fuzzy language whose syntactic monoid is isomorphic to the group Zn
A perishable inventory optimization model for two commodities in multi-echelon system
Full text linkIn this article, we delve into the quest for an optimal solution within the realm of a practical inventory system, which serves as an integral component of a larger Multiechelon inventory system. Our study focuses on a warehouse (WH) that houses a single Distribution Center (DC) and a sole retailer (R) tasked with managing two distinct yet interconnected perishable products. This setup is modeled as a three-stage continuous review inventory system. At the retailer node, we implement an (s, S) inventory system, accommodating Poisson demand and exponentially distributed lead times. It’s important to note that the primary products are susceptible to perishing exclusively at the retailer node, characterized by a rate ζ, whereas the sub-products are non-perishable in nature. Deliveries to retailers occur in packs of Qi(= Si − si) units, originating from the distribution center (DC) with immediate replenishment capabilities sourced from the well-stocked warehouse (WH). Throughout our analysis, we rigorously maintain steady-state probability distributions and behavioral insights. Furthermore, we diligently collect and analyze performance measurements for the system under steady-state conditions. Our findings are showcased through numerical examples, shedding light on the practical implications of our inventory management approach
On the Edge Covering Transversal Edge Domination in Graphs
Full text linkLet G = (V,E) be any graph with nvertices and medges. An edge dominating set which intersects every minimum edge covering set in a graph Gis called an edge covering transversal edge dominating set of G. The minimum cardinality of an edge covering transversal edge dominating set is called an edge covering transversal edge domination number of Gand is denoted by \gamma_{eect}(G). Any edge covering transversal edge dominating set of cardinalities\gamma_{eect}(G) is called a \gamma_{eect}-set of G. The edge covering transversal edge domination number of some standard graphs are determined. Some properties satisfied by this concept are studied
Transversal Eccentric Domination in Graphs
Full text linkWe introduce transversal eccentric dominating(TED) set. An eccentric dominating set is called a TED-set if it intersects with every minimum eccentric dominating set . We find the TED-number of some standard graphs. Results are stated and proved