نتایج جستجو برای: polynomial dynamics
تعداد نتایج: 534873 فیلتر نتایج به سال:
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.
Suppose G is an nvertex and medge simple graph with edge set E(G). An integervalued 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 standard MIMO LTI continuous-time systems S(A,B,C) the classical notion of the Smith zeros does not characterize fully the output-zeroing problem nor the zero dynamics. The question how this notion can be extended and related to the state-space methods is discussed. Nothing is assumed about the relationship of the number of inputs to the number of outputs nor about the normal rank of the und...
In standard MIMO LTI continuous-time systems S(A,B,C) the classical notion of the Smith zeros does not characterize fully the output-zeroing problem nor the zero dynamics. The question how this notion can be extended and related to the state-space methods is discussed. Nothing is assumed about the relationship of the number of inputs to the number of outputs nor about the normal rank of the und...
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.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید