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...

‎    The Narumi-Katayama index is the first topological index defined by the product of some graph theoretical quantities. Let G be a simple graph. Narumi-Katayama index of G is defined as the product of the degrees of the vertices of G. In this paper, we define the Narumi-Katayama polynomial of G. Next, we investigate some properties of this polynomial for graphs and then, we obtain ...

Let G = (V, E) be a simple graph. Hosoya polynomial of G is d(u,v) H(G, x) = {u,v}V(G)x , where, d(u ,v) denotes the distance between vertices u and v. As is the case with other graph polynomials, such as chromatic, independence and domination polynomial, it is natural to study the roots of Hosoya polynomial of a graph. In this paper we study the roots of Hosoya polynomials of some specific g...

The Wiener index is a graph invariant that has found extensive application in chemistry. In addition to that a generating function, which was called the Wiener polynomial, who’s derivate is a q-analog of the Wiener index was defined. In an article, Sagan, Yeh and Zhang in [The Wiener Polynomial of a graph, Int. J. Quantun Chem., 60 (1996), 959969] attained what graph operations do to the Wiene...

we consider the class of polynomial differential equation x&= , 2(,)(,)(,)nnmnmpxypxypxy++++2(,)(,)(,)nnmnmyqxyqxyqxy++&=++. for where and are homogeneous polynomials of degree i. inside this class of polynomial differential equation we consider a subclass of darboux integrable systems. moreover, under additional conditions we proved such darboux integrable systems can have at most 1 limit cycle.

in this paper, we introduce the new notion of strongly j-clean rings associatedwith polynomial identity g(x) = 0, as a generalization of strongly j-clean rings. we denotestrongly j-clean rings associated with polynomial identity g(x) = 0 by strongly g(x)-j-cleanrings. next, we investigate some properties of strongly g(x)-j-clean.

For a polynomial p(z) of degree n, having all zeros in |z|< k, k< 1, Dewan et al [K. K. Dewan, N. Singh and A. Mir, Extension of some polynomial inequalities to the polar derivative, J. Math. Anal. Appl. 352 (2009) 807-815] obtained inequality between the polar derivative of p(z) and maximum modulus of p(z). In this paper we improve and extend the above inequality. Our result generalizes certai...

let g be a simple graph and (g,) denotes the number of proper vertex colourings of gwith at most  colours, which is for a fixed graph g , a polynomial in  , which is called thechromatic polynomial of g . using the chromatic polynomial of some specific graphs, weobtain the chromatic polynomials of some nanostars.

this paper presents a gain scheduled autopilot for pitch channel of a flying vehicle. the selected method is based on polynomial fuzzy systems. the method does not involve linearization about operating point. first the polynomial fuzzy model of pitch channel of the flight body is derived. next, using polynomial fuzzy system methodology the controller is design such that the outputs of the nonli...

in this paper, rst a design is proposed for representing fuzzy polynomials withinput fuzzy and output fuzzy. then, we sketch a constructive proof for existenceof such polynomial which can be fuzzy interpolation polynomial in a set given ofdiscrete points rather than a fuzzy function. finally, to illustrate some numericalexamples are solved.