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

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.

In this paper the concept of the Minimum Universal Cost Flow (MUCF) for an infeasible flow network is introduced. A new mathematical model in which the objective function includes the total costs of changing arc capacities and sending flow is built and analyzed. A polynomial time algorithm is presented to find the MUCF.

in this paper the concept of the minimum universal cost flow (mucf) for an infeasible flow network is introduced. a new mathematical model in which the objective function includes the total costs of changing arc capacities and sending flow is built and analyzed. a polynomial time algorithm is presented to find the mucf.

in this paper, the ritz-galerkin method in bernstein polynomial basis is applied for solving the nonlinear problem of the magnetohydrodynamic (mhd) flow of third grade fluid between the two plates. the properties of the bernstein  polynomials together with the ritz-galerkin method are used to reduce the solution of the mhd couette flow of non-newtonian fluid in a porous medium to the solution o...

In this paper, the Ritz-Galerkin method in Bernstein polynomial basis is applied for solving the nonlinear problem of the magnetohydrodynamic (MHD) flow of third grade fluid between the two plates. The properties of the Bernstein  polynomials together with the Ritz-Galerkin method are used to reduce the solution of the MHD Couette flow of non-Newtonian fluid in a porous medium to the solution o...

The multicommodity flow problem is NP-hard already for two commodities over bipartite graphs. Nonetheless, using our recent theory of n-fold integer programming and extensions developed herein, we are able to establish the surprising polynomial time solvability of the problem in two broad situations.

The question about behavior of gaps between zeros polynomials under differentiation is classical and goes back to Marcel Riesz. Recently, Stefan Steinerberger [42] formally derived a nonlocal nonlinear partial differential equation which models dynamics roots differentiation. In this paper, we connect rigorously solutions Steinerberger’s PDE evolution for class trigonometric polynomials. Namely...