We study in this paper the composition operator of induced by the function ?(z)=sz+t where , and We characterize the normal composition operator C? on Hardy space H2 and other related classes of operators. In addition to that we study the essential normality of C? and give some other partial results which are new to the best of our knowledge.

We study in this paper the composition operator that is induced by ?(z) = sz + t. We give a characterization of the adjoint of composiotion operators generated by self-maps of the unit ball of form ?(z) = sz + t for which |s|?1, |t|<1 and |s|+|t|?1. In fact we prove that the adjoint is a product of toeplitz operators and composition operator. Also, we have studied the compactness of C? and give some other partial results.

  In this paper we introduce a new class of degree of best algebraic approximation polynomial Α,, for unbounded functions in weighted space Lp,α(X), 1 ∞ .We shall prove direct and converse theorems for best algebraic approximation in terms modulus of smoothness in weighted space

     A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex.  For a simple undirected graph G with order n, and let  denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C

In this work,  an explicit formula for a class of Bi-Bazilevic univalent functions involving differential operator is given, as well as the determination of upper bounds for the general Taylor-Maclaurin coefficient of a functions belong to this class, are established Faber polynomials are used as a coordinated system to study the geometry of the manifold of coefficients for these functions. Also determining bounds for the first two coefficients of such functions.

         In certain cases, our initial estimates improve some of the coefficient bounds and link them to earlier thoughtful results that are published earlier.

Necessary and sufficient conditions for the operator equation I AXAX n*, to have a real positive definite solution X are given. Based on these conditions, some properties of the operator A as well as relation between the solutions X andAare given.

Our goal in the present paper is to recall the concept of general fuzzy normed space and its basic properties in order to define the adjoint operator of a general fuzzy bounded operator from a general fuzzy normed space V into another general fuzzy normed space U. After that basic properties of the adjoint operator were proved then the definition of fuzzy reflexive general fuzzy normed space was introduced in order to prove that every finite dimensional general fuzzy normed space is fuzzy reflexive.

  Necessary and sufficient conditions for the operator equation I AXAX n  * , to have a real positive definite solution X are given. Based on these conditions, some properties of the operator A as well as relation between the solutions X andAare given.

Cryptography is the process of transforming message to avoid an unauthorized access of data. One of the main problems and an important part in cryptography with secret key algorithms is key. For higher level of secure communication key plays an important role. For increasing the level of security in any communication, both parties must have a copy of the secret key which, unfortunately, is not that easy to achieve. Triple Data Encryption Standard algorithm is weak due to its weak key generation, so that key must be reconfigured to make this algorithm more secure, effective, and strong. Encryption key enhances the Triple Data Encryption Standard algorithm securities. This paper proposed a combination of two efficient encryption algorithms to