This paper is concerned with introducing and studying the first new approximation operators using mixed degree system and second new approximation operators using mixed degree system which are the core concept in this paper. In addition, the approximations of graphs using the operators first lower and first upper are accurate then the approximations obtained by using the operators second lower and second upper sincefirst accuracy less then second accuracy. For this reason, we study in detail the properties of second lower and second upper in this paper. Furthermore, we summarize the results for the properties of approximation operators second lower and second upper when the graph G is arbitrary, serial 1, serial 2, reflexive, symmetric, tra

    In this paper , we study some approximation  properties of the strong difference and study the relation between the strong difference and the weighted modulus of continuity

In this paper, we introduce a class of operators on a Hilbert space namely quasi-posinormal operators that contain properly the classes of normal operator, hyponormal operators, M–hyponormal operators, dominant operators and posinormal operators . We study some basic properties of these operators .Also we are looking at the relationship between invertibility operator and quasi-posinormal operator .

The purpose of this paper is to find the best multiplier approximation of unbounded functions in    –space by using some discrete linear positive operators. Also we will estimate the degree of the best multiplier approximation in term of modulus of continuity and the averaged modulus.

Many codiskcyclic operators on infinite-dimensional separable Hilbert space do not satisfy the criterion of codiskcyclic operators. In this paper, a kind of codiskcyclic operators satisfying the criterion has been characterized, the equivalence between them has been discussed and the class of codiskcyclic operators satisfying their direct summand is codiskcyclic. Finally, this kind of operators is used to prove that every codiskcyclic operator satisfies the criterion if the general kernel is dense in the space.

The aim of this paper is to generate topological structure on the power set of vertices of digraphs using new definition which is Gm-closure operator on out-linked of digraphs. Properties of this topological structure are studied and several examples are given. Also we give some new generalizations of some definitions in digraphs to the some known definitions in topology which are Ropen subgraph, α-open subgraph, pre-open subgraph, and β-open subgraph. Furthermore, we define and study the accuracy of these new generalizations on subgraps and paths.

            In this paper, several conditions are put in order to compose the sequence of partial sums ,  and  of the fractional operators of analytic univalent functions ,  and   of bounded turning which are bounded turning too.

The goal of this study is to provide a new explicit iterative process method  approach for solving maximal monotone(M.M )operators in Hilbert spaces utilizing a finite family of different types of  mappings as( nonexpansive mappings,resolvent mappings and projection mappings. The findings given in this research strengthen and extend key previous findings in the literature. Then, utilizing various structural conditions in Hilbert space and variational inequality problems, we examine the strong convergence to nearest point projection for these explicit iterative process methods Under the presence of two important conditions for convergence, namely closure and convexity. The findings reported in this research strengthen and extend

In this paper, some basic notions and facts in the b-modular space similar to those in the modular spaces as a type of generalization are given.  For example, concepts of convergence, best approximate, uniformly convexity etc. And then, two results about relation between semi compactness and approximation are proved which are used to prove a theorem on the existence of best approximation for a semi-compact subset of b-modular space.