Modeling of Prey Predator Problem by a Graph Dierential Equation
Keywords:
Simple Graph, Pseudo simple graph, product of graphs, graph dierential equation and prey predator model.Abstract
Abstract : In this paper, we introduce new concepts like a pseudo simplegraph, product of two graphs and obtain a sucient condition which will
guarantee that the solution of the IVP of a graph dierential equation has
the same nature as its graph of initial conditions. Further, we model the well
known prey-predator problem by graph dierential equations and show that
the nonlinearity is naturally preserved.
Downloads
Published
2014-01-29
Issue
Section
Mathematical Biosciences
License
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.
How to Cite
Modeling of Prey Predator Problem by a Graph Dierential Equation. (2014). European Journal of Pure and Applied Mathematics, 7(1), 37-44. https://www.ejpam.com/index.php/ejpam/article/view/1901