The Omega polynomial(x) was recently proposed by Diudea, based on the length of strips in given graph G. The Sadhana polynomial has been defined to evaluate the Sadhana index of a molecular graph. The PI polynomial is another molecular descriptor. In this paper we compute these three polynomials for some infinite classes of nanostructures.

In this paper, the concept of canonical representation is proposed to find fuzzy roots of fuzzy polynomial equations. We transform fuzzy polynomial equations to system of crisp polynomial equations, this transformation is perform by using canonical representation based on three parameters Value, Ambiguity and Fuzziness. 

This paper is mainly developed around the diagonal section which strongly related to tail dependence coefficients as defined in Nelsen [19]. Hence, we propose a flexible method for estimating based on new smooth estimation of Bernstein polynomial approximation. To assess performance estimators conduct Monte-Carlo simulation study. As result study, both perform satisfactory performance. Also, me...

Suppose G is an nvertex and medge simple graph with edge set E(G). An integervalued function f: E(G) → Z is called a flow. Tutte was introduced the flow polynomial F(G, λ) as a polynomial in an indeterminate λ with integer coefficients by F(G,λ) In this paper the Flow polynomial of some dendrimers are computed.

The Tutte polynomial of a graph G, T(G, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. In this paper a simple formula for computing Tutte polynomial of a benzenoid chain is presented.

In this paper, we establish some Bernstein type inequalities for the complex polynomial. Our results constitute generalizations and refinements of some well-known polynomial inequalities.

ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...

Standard array data dependence techniques can only reason about linear constraints. There has also been work on analyzing some dependences involving polynomial constraints. Analyzing array data dependences in real-world programs requires handling many \unanalyzable" terms: subscript arrays, run-time tests, function calls. The standard approach to analyzing such programs has been to omit and ign...