Modeling of Prey Predator Problem by a Graph Dierential Equation

J Vasundhara Devi, R V.G Ravi Kumar

Abstract

Abstract : In this paper, we introduce new concepts like a pseudo simple
graph, 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.

Keywords

Simple Graph, Pseudo simple graph, product of graphs, graph dierential equation and prey predator model.

Full Text:

PDF