APAV - Academy of Sciences, Letters, Arts and Technology (E-Journals)
Not a member yet
757 research outputs found
Sort by
Common Fixed Point For A Contractive Mapping Via (\alpha, \beta, \psi)-admissibility In B-metric Space
No full textIn this paper, we establish the concept of a common fixed point theorem for a pair of self-mappings (R,S) in b-metric space via (\alpha, \beta, \psi )-Admissibility type contractive condition. And illustrate an example
Some Characteristics Of Picture Fuzzy Subgroups Via Cut Set Of Picture Fuzzy Set
Get PDFGiven any picture fuzzy set Q of a universe Y , the set Cr,s,t(Q) called the (r, s, t)-cut set of Q was studied. In this paper, some characteristics of picture fuzzy subgroup of a group are obtained via the cut sets of picture fuzzy set
The Impact of the Enlightenment on the Development of Scientific Fields in the Romanian Provinces
Get PDFThis paper aims to outline certain aspects of the changes brought about by the Age of Enlightenment on the overall progress of society. Emphasis will be placed on its specific features in the Romanian provinces and the impact of this movement on the development of various scientific fields
Properties of Intuitionistic Multi-Anti Fuzzy Normal Ring
Get PDFIn this paper, we discuss the properties of an intuitionistic multi-anti fuzzy normal ring of a ring is defined and discussed its properties. some results based on cartesian product, homomorphism and anti homomorphism of an intuitionistic multi-anti fuzzy normal ring of a ring are also discusse
More Functions Related to ŠΑ^* - Open Set in Soft Topological Spaces
Get PDFIn this paper, we introduce some soft functions like Š Strongly - continuous function, Š Perfectly - continuous function, Š Totally - continuous function. We study the connections of these function with other Š function. Also, we establish the relationships in between the above functions and also investigate various aspects of these functions
Product Signed Domination in Graphs
Get PDFLet be a simple graph. The closed neighborhood of , denoted by , is the set . A function is a product signed dominating function, if for every vertex where . The weight of , denoted by , is the sum of the function values of all the vertices in . . The product signed domination number of is the minimum positive weight of a product signed dominating function. In this paper, we establish bounds on the product signed domination number and estimate product signed domination number for some standard graph
Topological Indices Of Some Anticancer Drugs
Get PDFEvery sixth death in the world is due to cancer, making it the second leading cause of death. Around one-third of deaths from cancer are due to tobacco use, high body mass index, alcohol use, low fruit and vegetable intake, and lack of physical activity. Anticancer drugs are those which are used to cure malignant disease i.e., Cancer. Topological indices are used to model physico-chemical properties and biological activities of chemical compounds. In this paper, we compute \textit{-polynomial} and \textit{-polynomial} of anticancer drugs. Further, we retrieve some degree and neighborhood degree based topological indices of anticancer drugs from their respective \textit{-polynomial} and -polynomial. The theoretical results obtained in this article have promising aspects in designing novel drug for the treatment of Cancer
Gaussian Tribonacci R-Graceful Labeling of Some Tree Related Graphs
Get PDFLet r be any natural number. An injective function , where is the Gaussian Tribonacci number in the Gaussian Tribonacci sequence is said to be Gaussian Tribonacci r-graceful labeling if the induced edge labeling such that is bijective. If a graph G admits Gaussian Tribonacci r-graceful labeling, then G is called a Gaussian Tribonacci r-graceful graph. A graph G is said to be Gaussian Tribonacci arbitrarily graceful if it is Gaussian Tribonacci r-graceful for all r. In this paper we investigate the Path graph , the Comb graph , the Coconut tree graph the regular caterpillar graph , the Bistar graph and the Subdivision of Bistar graph are Gaussian Tribonacci arbitrarily graceful
Medium Domination Decomposition of Graphs
Get PDFA set of vertices in a graph dominates if every vertex in is either in or adjacent to a vertex in . The size of any smallest dominating set is called domination number of . The concept of Medium Domination Number was introduced by Vargor and Dunder which finds the total number of vertices that dominate all pairs of vertices and evaluate the average of this value. The Medium domination Number is a notation which uses neighbourhood of each pair of vertices. For G = (V, E) and ∀u,v∈ V if u, v are adjacent they dominate each other, then atleast dom (u, v) = 1. The total number of vertices that dominate every pair of vertices is defined as TDV(G)=∑dom(u,v), for every u,v∈V(G). For any connected, undirected, loopless graph G of order p, the Medium Domination Number MD(G) = . In this paper we have introduced the new concept Medium Domination Decomposition. A decomposition of a graphG is said to be Medium Domination Decomposition (MDD) i
The Extension of Generalized Intuitionistic Topological Spaces
Get PDFIn this paper, irresolute functions in generalized intuitionistic topological spaces were introduced. Regarding this function, some minimal and maximal irresolute functions were introduced. In addition, the generalized intuitionistic topological spaces were extended by using their open sets which is finer than of it and their basic characterizations were investigated. Also some continuous functions in extension of generalized intuitionistic topological spaces were discussed