The topic of modulus of smoothness still gets the interest of many researchers due to its applicable usage in different fields, especially for function approximation. In this paper, we define a new modulus of smoothness of weighted type. The properties of our modulus are studied. These properties can be easily used in different fields, in particular, the functions in the Besov spaces when
In this paper, we study the concepts of generalized reverse derivation, Jordan
generalized reverse derivation and Jordan generalized triple reverse derivation on -
ring M. The aim of this paper is to prove that every Jordan generalized reverse
derivation of -ring M is generalized reverse derivation of M.
The Detour distance is one of the most common distance types used in chemistry and computer networks today. Therefore, in this paper, the detour polynomials and detour indices of vertices identified of n-graphs which are connected to themselves and separated from each other with respect to the vertices for n≥3 will be obtained. Also, polynomials detour and detour indices will be found for another graphs which have important applications in Chemistry.
In this thesis, we introduce eight types of topologies on a finite digraphs and state the implication between these topologies. Also we studied some pawlak's concepts and generalization rough set theory, we introduce a new types for approximation rough digraphs depending on supra open digraphs. In addition, we present two various standpoints to define generalized membership relations, and state the implication between it, to classify the digraphs and help for measure exactness and roughness of digraphs. On the other hand, we define several kinds of fuzzy digraphs. We also introduce a topological space, which is induced by reflexive graph and tolerance graphs, such that the graph may be infinite. Furthermore, we offered some properties of th
... Show MoreThe primary objective of this paper, is to introduce eight types of topologies on a finite digraphs and state the implication between these topologies. Also we used supra open digraphs to introduce a new types for approximation rough digraphs.
Richards in 1996 introduced the idea of leftly e ─ core transference by using many conditions, including that the difference between the colums (k) is greater than of weight. In this paper, we generalized this idea without the condition of Richards depending on the mathematical and computational solution.
A space X is named a πp – normal if for each closed set F and each π – closed set F’ in X with F ∩ F’ = ∅, there are p – open sets U and V of X with U ∩ V = ∅ whereas F ⊆ U and F’ ⊆ V. Our work studies and discusses a new kind of normality in generalized topological spaces. We define ϑπp – normal, ϑ–mildly normal, & ϑ–almost normal, ϑp– normal, & ϑ–mildly p–normal, & ϑ–almost p-normal and ϑπ-normal space, and we discuss some of their properties.
By use the notions pre-g-closedness and pre-g-openness we have generalized a class of separation axioms in topological spaces. In particular, we presented in this paper new types of regulαrities, which we named ρgregulαrity and Sρgregulαrity. Many results and properties of both types have been investigated and have illustrated by examples.
Let R be an associative ring with identity, and let M be a unital left R-module, M is called totally generalized *cofinitely supplemented module for short ( T G*CS), if every submodule of M is a Generalized *cofinitely supplemented ( G*CS ). In this paper we prove among the results under certain condition the factor module of T G*CS is T G*CS and the finite sum of T G*CS is T G*CS.
In this paper an improved weighted 0-1 knapsack method (WKM) is proposed to optimize the resource allocation process when the sum of items' weight exceeds the knapsack total capacity .The improved method depends on a modified weight for each item to ensure the allocation of the required resources for all the involved items. The results of the improved WKM are compared to the traditional 0-1 Knapsack Problem (KP). The proposed method dominates on the other one in term of the total optimal solution value of the knapsack .