In this paper we present a study on Peristaltic of fractional generalized Maxwell viscoelastic fluid through a porous medium. A modified Darcy-Brinkman model is utilized to simulate the flow of a generalized Maxwell fluid in a porous medium in an inclined channel with slip effect. The governing equation is simplified by assuming long wavelength and low Reynolds number approximations. The numerical and approximate analytical solutions of the problem are obtained by a semi-numerical technique, namely the homotopy perturbation method. The influence of the dominating physical parameters such as fractional Maxwell parameter, relaxation time, amplitude ratio, permeability parameter, Froude number, Reynolds number and inclination of channel on

Estimation the unknown parameters of a two-dimensional sinusoidal signal model is an important and a difficult problem , The importance of this model  in modeling Symmetric gray- scale texture image . In this paper, we propose employment Deferential Evaluation algorithm and the use of Sequential approach to estimate the unknown frequencies and amplitudes of the 2-D sinusoidal components when the signal is affected by noise. Numerical simulation are performed for different sample size, and various level of standard deviation to observe the performance of this method in estimate the parameters of 2-D sinusoidal signal model , This model was used for modeling  the Symmetric gray scale texture image and estimating by using

The aim of this paper is to introduce the definition of a general fuzzy norned space as a generalization of the notion fuzzy normed space after that some illustrative examples are given then basic properties of this space are investigated and proved.

For example when V and U are two general fuzzy normed spaces then the operator  is a general fuzzy continuous at u  V if and only if u in V implies S(u) in U.

            The article describes a certain computation method of -arcs to construct the number of distinct -arcs in  for . In this method, a new approach employed to compute the number of -arcs and the number of distinct arcs respectively. This approach is based on choosing the number of inequivalent classes } of -secant distributions that is the number of 4-secant, 3-secant, 2-secant, 1-secant and 0-secant in each process. The maximum size of -arc that has been constructed by this method is . The new method is a new tool to deal with the programming difficulties that sometimes may lead to programming problems represented by the increasing number of arcs. It is essential to reduce the established number of -arcs in each cons

A cap of size  and degree  in a projective space, (briefly; (k,r)-cap) is a set of  points with the property that each line in the space meet it in at most  points. The aim of this research is to extend the size and degree of complete caps and incomplete caps, (k, r)-caps of degree r<12 in the finite projective space of dimension three over the finite field of order eleven, which already exist and founded by the action of subgroups of the general linear group over the finite field of order eleven and degree four, to (k+i,r+1) -complete caps. These caps have been classified by giving the t_i-distribution and -distribution. The Gap programming has been used to execute the designed algorit

     This research aims to present some  results for  conceptions of  quasi -hyponormal operator defined on Hilbert space . Signified by the -operator, together with some significant characteristics of this operator and various theorems pertaining to this operator are discussed, as well as, we discussed the null space and range of these  kinds of operators.

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 K_n, Complete bipartite graph K_m,n and Complete tripartite graph K_l,m,n. It has also been studied how the lucky number changes whi

MDS code is a linear code that achieves equality in the Singleton bound, and projective MDS (PG-MDS) is MDS code with independents property of any two columns of its generator matrix.   In this paper, elementary methods for modifying a PG-MDS code of dimensions 2, 3, as extending and lengthening, in order to find new incomplete PG-MDS codes have been used over . Also, two complete PG-MDS codes over  of length  and 28 have been found.

In this paper, a new idea to configure a special graph from the discrete topological space is given. Several properties and bounds of this topological graph are introduced. Such that if the order of the non-empty set equals two, then the topological graph is isomorphic to the complete graph. If the order equals three, then the topological graph is isomorphic to the complement of the cycle graph. Our topological graph has  complete induced subgraphs with order  or more. It also has a cycle subgraph. In addition, the clique number is obtained. The topological graph is proved simple, undirected, connected graph. It has no pendant vertex, no isolated vertex and no cut vertex. The minimum and maximum degrees are evaluated. So , the radius 

The chemical properties of chemical compounds and their molecular structures are intimately connected. Topological indices are numerical values associated with chemical molecular graphs that help in understanding the physicochemical properties, chemical reactivity and biological activity of a chemical compound. This study obtains some topological properties of second and third dominating David derived (DDD) networks and computes several K Banhatti polynomial of second and third type of DDD.