Influence of Non-Selective Harvesting and Prey Reserve Capacity on Prey-Predator Dynamics
Journal Title: INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY - Year 2013, Vol 4, Issue 11
Abstract
In the present paper, we have developed a simple two species prey-predator model in which the prey dispersal in a two patch environment, one is assumed to be a free hunting zone and the other is a reserved zone where hunting and other extractive activities are prohibited. We assume that the prey possesses heterogeneous intrinsic growth rate with uniform carrying capacity. We also see the effect of non selective harvesting on prey-predator system in a free hunting zone. Criteria for local stability of the non-negative equilibria are obtained. Using differential inequality, we obtain sufficient conditions that ensure the persistence of the system. Finally, numerical simulations are given to verify the analytical results with the help of different sets of parameters
Authors and Affiliations
Manju Agarwal , Rachana Pathak
Keywords
Related Articles
- EP ID EP93763
- DOI -
- Views 110
- Downloads 0
The Discrete Logarithm Problem in the ElGamal Cryptosystem over the Abelian Group U(n) Where n= pm,or 2pm
This study is mainly about the discrete logarithm problem in the ElGamal cryptosystem over the abelian group U(n) where n is one of the following forms pm, or 2pm where p is an odd large prime and m is a positive integer...
Vertex- Edge Dominating Sets and Vertex-Edge Domination Polynomials of Paths
Let G = (V, E) be a simple Graph. A set S ļ V(G) is a vertex-edge dominating set (or simplyve-dominating set) if for all edges e ļ E(G), there exist a vertex v ļ S such that v dominates e. In this paper, we study the con...
(sp)* Closed Sets in Topological Spaces
In this paper we introduce a new class of sets namely, (sp)*-closed sets and properties of this set are investigated. We introduce (sp)*-continuous maps and (sp)*-irresolute maps.
Fact Type Results in Half Domination in Graphs
Let G = (V, E) be a finite graph with n vertices and m edges. A subset Dā V of vertices in a graph G is called half dominating set if at least half of the vertices of V(G) are either in D or adjacent to vertices of D. (i...
RELATIONAL ALGEBRA IN SQL
Relational Algebra is that branch of algebra which deals about set operations on a given relation such as UNION,INTERSECTION,DIFFERENCE,CARTESIAN PRODUCT, PROJECTION ,SELECTION. In this paper we shall discuss these...