With simple and undirected connected graph Φ, the Schultz and modified Schultz polynomials are defined as  and , respectively, where the summation is taken over all unordered pairs of distinct vertices in V(Φ), where V(Φ) is the vertex set of Φ, degu  is the degree of vertex u and d(v,u) is the ordinary distance between v and u, u≠v. In this study, the Shultz distance, modified Schultz distance, the polynomial, index, and average for both have been generalized, and this generalization has been applied  to some special graphs.

     This paper introduced a hybrid technique for lossless image compression of natural and medical images; it is based on integrating the bit plane slicing and Wavelet transform along with a mixed polynomial of linear and non linear base. The experiments showed high compression performance with fully grunted reconstruction.

In this paper, some necessary and sufficient conditions are obtained to ensure the oscillatory of all solutions of the first order impulsive neutral differential equations. Also, some results in the references have been improved and generalized. New lemmas are established to demonstrate the oscillation property. Special impulsive conditions associated with neutral differential equation are submitted. Some examples are given to illustrate the obtained results.

    In this paper, we derive some subordination and superordination results for certain subclasses of p− valent analytic functions that defined by generalized Fox-wright functions using the principle of differential subordination, ----------producing best dominant univalent solutions. We have also derived inclusion relations and solved majorization problem.

Recently, new generalizations have been presented for the hyponormal operators, which are (N, k)-hyponormal operators and (h, M)-hyponormal operators. Some properties of these concepts have also been proved, one of these properties is that the product of two (N, k)-hyponormal operator is also (N, k)- hyponormal operator and the product of two (h, M)-hyponormal operators is (h, M)-hyponormal operator. In our research, we will reprove these properties by using the (l,m)-commuting operator equations, in addition to that we will solve the (l, m)-commuting operator equations for (N, k)-hyponormal operators and (h, M)-hyponormal operators.

In a connected graph , the distance function between each pair of two vertices from a set vertex  is the shortest distance between them and the vertex degree  denoted by  is the number of edges which are incident to the vertex  The Schultz and modified Schultz polynomials of  are have defined as:

 respectively, where the summations are taken over all unordered pairs of distinct vertices in  and  is the distance between  and  in  The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.

Discrete Krawtchouk polynomials are widely utilized in different fields for their remarkable characteristics, specifically, the localization property. Discrete orthogonal moments are utilized as a feature descriptor for images and video frames in computer vision applications. In this paper, we present a new method for computing discrete Krawtchouk polynomial coefficients swiftly and efficiently. The presented method proposes a new initial value that does not tend to be zero as the polynomial size increases. In addition, a combination of the existing recurrence relations is presented which are in the n- and x-directions. The utilized recurrence relations are developed to reduce the computational cost. The proposed method computes app

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

In this paper we recall the definition of fuzzy length space on a fuzzy set after that we recall basic definitions and properties of fuzzy length. We define fuzzy bounded operator as an introduction to defined fuzzy length of an operator then we proved that the fuzzy length space FB ̃ ̃ consisting of all fuzzy bounded linear operators from a fuzzy length space ̃ into a fuzzy length space ̃ is fuzzy complete if ̃ is fuzzy complete. Also we proved that every finite dimensional fuzzy length space is fuzzy complete.