Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph Kn, Complete bipartite graph Km,n and Complete tripartite graph Kl,m,n. It has also been studied how the lucky number changes while adding a graph G with Kn and deleting an edge e from Kn.
The Assignment model is a mathematical model that aims to express a real problem facing factories and companies which is characterized by the guarantee of its activity in order to make the appropriate decision to get the best allocation of machines or jobs or workers on machines in order to increase efficiency or profits to the highest possible level or reduce costs or time To the extent possible, and in this research has been using the method of labeling to solve the problem of the fuzzy assignment of real data has been approved by the tire factory Diwaniya, where the data included two factors are the factors of efficiency and cost, and was solved manually by a number of iterations until reaching the optimization solution,
... Show MoreIn this article, the partially ordered relation is constructed in geodesic spaces by betweeness property, A monotone sequence is generated in the domain of monotone inward mapping, a monotone inward contraction mapping is a monotone Caristi inward mapping is proved, the general fixed points for such mapping is discussed and A mutlivalued version of these results is also introduced.
In this paper, the concept of normalized duality mapping has introduced in real convex modular spaces. Then, some of its properties have shown which allow dealing with results related to the concept of uniformly smooth convex real modular spaces. For multivalued mappings defined on these spaces, the convergence of a two-step type iterative sequence to a fixed point is proved
Antimagic labeling of a graph with vertices and edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph are pairwise distinct. Where the vertex-weights of a vertex under this labeling is the sum of labels of all edges incident to this vertex, in this paper, we deal with the problem of finding vertex antimagic edge labeling for some special families of graphs called strong face graphs. We prove that vertex antimagic, edge labeling for strong face ladder graph , strong face wheel graph , strong face fan graph , strong face prism graph and finally strong face friendship graph .
Background: Cytokines have an essential contribution to the inflammatory response and the development of chronic inflammation. Therefore, it has a pivotal role in the pathogenesis of rheumatoid arthritis (RA). Interleukins are closely related to RA, and the exact role of some interleukins in the pathogenesis of RA is not yet known.
Objectives: To evaluate the levels of interleukins and their ratio, since the levels of interleukins 35 and 39 in RA patients have not yet been determined in Iraq.
Patients and methods: An ELISA (enzyme-linked immunosorbent assay) was used to measure the levels of interleukins in the blood of 56 patients with RA and 44 healthy volunteers who were enrolled in the study from November 2021 to March 2022.
Consider a simple graph on vertices and edges together with a total labeling . Then ρ is called total edge irregular labeling if there exists a one-to-one correspondence, say defined by for all where Also, the value is said to be the edge weight of . The total edge irregularity strength of the graph G is indicated by and is the least for which G admits edge irregular h-labeling. In this article, for some common graph families are examined. In addition, an open problem is solved affirmatively.
. Suppose that is the Cayley graph whose vertices are all elements of and two vertices and are adjacent if and only if . In this paper,we introduce the generalized Cayley graph denoted by which is a graph with a vertex set consisting of all column matrices in which all components are in and two vertices and are adjacent if and only if , where is a column matrix that each entry is the inverse of the similar entry of and is matrix with all entries in , is the transpose of and and m . We aim to provide some basic properties of the new graph and determine the structure of when is a complete graph for every , and n, m .
Heterocyclic systems, which are essential in medicinal chemistry due to their promising cytotoxic activity, are one of the most important families of organic molecules found in nature or produced in the laboratory. As a result of coupling N-(4-nitrophenyl)-3-oxo-butanamide (3) using thiourea, indole-3-carboxaldehyde, or piperonal, the pyrimidine derivatives (5a and 5b) were produced. Furthermore, pyrimidine 9 was synthesized by reacting thiophene-2-carboxaldehyde with ethyl cyanoacetate and urea with potassium carbonate as a catalyst. The chalcones 11a and 11b were synthesized by reacting equal molar quantities of 1-naphthaldehy
... Show MoreThe concept of epiform modules is a dual of the notion of monoform modules. In this work we give some properties of this class of modules. Also, we give conditions under which every hollow (copolyform) module is epiform.
The main purpose of this paper is to study some results concerning reduced ring with another concepts as semiprime ring ,prime ring,essential ideal ,derivations and homomorphism ,we give some results a bout that.