No abstract

No abstract

The numerical approximation of Price Reyleigh equation is considered using delay as parameter. Fist, the delay difference equation obtained by using Euler method is written as a map.According to the theories of bifurcation for discrete dynamical systems, the conditions to guarantee the existence of Hopf bifurcation for numerical approximation are given. The relations of Hopf bifurcation between the continuous and the discrete are discussed. That when the Price Reyleigh equation has Hopf bifurcations at , the numerical approximation also has Hopf bifurcations at is proved.

Fullerenes graphs are 3-connected, 3-regular planar graphs with faces including only pentagons and hexagons. If be a graph with a perfect matching, a subgraph H of G is a nice subgraph if G-V(H) has a perfect matching. In this paper, we show that in every fullerene graph arising from smaller fullerenes via chamfer transformation, each pair of pentagons is a nice subgraph.