The neighbourhood polynomial G , is generating function for the number of faces of each cardinality in the neighbourhood complex of a graph. In other word $N(G,x)=sum_{Uin N(G)} x^{|U|}$, where N(G) is neighbourhood complex of a graph, whose vertices are the vertices of the graph and faces are subsets of vertices that have a common neighbour. In this paper we compute this polynomial for some na...

In this article, by using Chebyshev’s polynomials and Chebyshev’s expansion, we obtain the best uniform polynomial approximation out of P2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. Using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...

In this article, Ritz approximation have been employed to obtain the numerical solutions of a class of the fractional optimal control problems based on the Caputo fractional derivative. Using polynomial basis functions, we obtain a system of nonlinear algebraic equations. This nonlinear system of equation is solved and the coefficients of basis polynomial are derived. The convergence of the num...

the harmonic index h(g) , of a graph g is defined as the sum of weights 2/(deg(u)+deg(v)) of all edges in e(g), where deg (u) denotes the degree of a vertex u in v(g). in this paper we define the harmonic polynomial of g. we present explicit formula for the values of harmonic polynomial for several families of specific graphs and we find the lower and upper bound for harmonic index in caterpill...

in the present work, the effects of operating conditions including ph, transmembrane pressure, oil concentration, and temperature on fouling resistance and the rejection of turbidity for a polymeric membrane in an ultrafiltration system of wastewater treatment were studied. a new modeling technique called evolutionary polynomial regression (epr) was investigated. epr is a method based on regres...

in this paper, we consider a new class of analytic functions in the unit disk using polynomials of order alpha. we give some sufficient conditions for functions belonging to this class.

Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G, x)=sum_{i=gamma(G)}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$ and $gamma(G)$ is the domination number of $G$. In this paper we present some families of graphs whose domination polynomials are unimodal.

Abstract. A case of the matrix Kummer relation of Herz (1955) based on the Pearson VII type matrix model is derived in this paper. As a con- sequence, the polynomial Pearson VII configuration density is obtained and this sets the corresponding exact inference as a solvable aspect in shape theory. An application in postcode recognition, including a nu- merical comparison between the exact poly...

Elzaki transform and Adomian polynomial is used to obtain the exact solutions of nonlinear fifth order Korteweg-de Vries (KdV) equations. In order to investigate the effectiveness of the method, three fifth order KdV equations were considered. Adomian polynomial is introduced as an essential tool to linearize all the nonlinear terms in any given equation because Elzaki transform cannot handle n...

‎Let $p(z)$ be a polynomial of degree $n$ and for a complex number $alpha$‎, ‎let $D_{alpha}p(z)=np(z)+(alpha-z)p'(z)$ denote the polar derivative of the polynomial p(z) with respect to $alpha$‎. ‎Dewan et al proved‎ ‎that if $p(z)$ has all its zeros in $|z| leq k, (kleq‎ ‎1),$ with $s$-fold zeros at the origin then for every‎ ‎$alphainmathbb{C}$ with $|alpha|geq k$‎, ‎begin{align*}‎ ‎max_{|z|=...