let g = (v, e) be a simple graph. hosoya polynomial of g isd(u,v)h(g, x) = {u,v}v(g)x , where, d(u ,v) denotes the distance between vertices uand v. as is the case with other graph polynomials, such as chromatic, independence anddomination polynomial, it is natural to study the roots of hosoya polynomial of a graph. inthis paper we study the roots of hosoya polynomials of some specific graphs.

Piecewise smooth hybrid systems, involving continuous and discrete variables, are suitable models for describing the multiscale regulatory machinery of the biological cells. In hybrid models, the discrete variables can switch on and off some molecular interactions, simulating cell progression through a series of functioning modes. The advancement through the cell cycle is the archetype of such ...

A lubrication model is used to study the dynamics of nanoscale droplets on wettability gradient surfaces. The effects of the gradient size, size of the nanodroplets and the slip on the dynamics have been studied. Our results indicate that the position of the center of mass of the droplets can be well described in terms of a third-order polynomial function of the time of the motion for all the c...

The real dynamics of a family of fourth-order iterative methods is studied when it is applied on quadratic polynomials. A Scaling Theorem is obtained and the conjugacy classes are analyzed. The convergence plane is used to obtain the same kind of information as from the parameter space, and even more, in complex dynamics.

Abstract: An approach to evaluate the number of errors encountered during the program testing process is proposed in the paper. Considerations are based on some program reliability-growth model, constructed for an assumed scheme of the program testing process. In this model the program under testing is characterized by means of the so-called characteristic matrix and the program testing process...

This note deals with the constant control problem for homogeneous cooperative and irreducible systems. These systems serve as models for positive systems. A necessary and sufficient condition for global asymptotic stability of the zero solution of this class of systems is known. Adding a constant control allows to shift the equilibrium point from zero to a point in the first orthant. We prove t...

This paper is concerned with the reachability computation problem for polynomial dynamical systems. Such computations constitute a crucial component in algorithmic verification tools for hybrid systems and embedded software with polynomial dynamics, which have found applications in many engineering domains. We describe two methods for over-approximating reachable sets of such systems; these met...