In this paper, the number of limit cycles in a family of polynomial systems was studied by the bifurcation methods. With the help of a computer algebra system (e.g., Maple 7.0), we obtain that the least upper bound for the number of limit cycles appearing in a global bifurcation of systems (2.1) and (2.2) is 5n + 5 + (1 − (−1)n)/2 for c ≠ 0 and n for c ≡ 0.
Computers and Mathematics with Applications,
Vol. 49, no. 11-12 (Jun 2005), pp. 1669-1678