نتایج جستجو برای: hosoya polynomial
تعداد نتایج: 97804 فیلتر نتایج به سال:
MYOSIN MOTORS AND NOT ACTIN COMETS ARE MEDIATORS OF THE ACTIN-BASED GOLGI-TO-ER PROTEIN TRANSPORT Juan M. Durán, Ferran Valderrama, Susana Castel, Juana Magdalena, Mónica Tomás, Hiroshi Hosoya, Jaime Renau-Piqueras, Vivek Malhotra, and Gustavo Egea Departament de Biologia Cel.lular i Anatomia Patològica, Facultat de Medicina, Institut d’Investigacions Biomèdiques August Pi i Sunyer (IDIBAPS), U...
Seibu Mochizuki, Benjamin Dieplinger, Evi Trenkwalder, Horst Schweer, Florian Kronenberg, Katsunori Ikewaki, Juergen R. Schaefer, Michael E. Frischmann, Keio Okubo, Tatsuo Hosoya, Lipoprotein in Hemodialysis Patients as Potential Cause of Premature Atherosclerosis Delayed In Vivo Catabolism of Intermediate-Density Lipoprotein and Low-Density Print ISSN: 1079-5642. Online ISSN: 1524-4636 Copyrig...
This paper deals with a result concerning the algebraic dual of the linear mapping defined by the multiplication of polynomial vectors by a given polynomial matrix over a commutative field
Fuzzy Hermite interpolation of 5th degree generalizes Lagrange interpolation by fitting a polynomial to a function f that not only interpolates f at each knot but also interpolates two number of consecutive Generalized Hukuhara derivatives of f at each knot. The provided solution for the 5th degree fuzzy Hermite interpolation problem in this paper is based on cardinal basis functions linear com...
Hosoya Polynomials of Steiner Distance of Complete m-partite Graphs and Straight Hexagonal Chains(*)
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.
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...
let $p(z)=z^s h(z)$ where $h(z)$ is a polynomial of degree at most $n-s$ having all its zeros in $|z|geq k$ or in $|z|leq k$. in this paper we obtain some new results about the dependence of $|p(rz)|$ on $|p(rz)| $ for $r^2leq rrleq k^2$, $k^2 leq rrleq r^2$ and for $rleq r leq k$. our results refine and generalize certain well-known polynomial inequalities.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید