Abstract
Let be a simple connected directed graph on vertices and let be a non-empty subset of and denote the undirected subgraph induced by by, We show that the \emph{competition graph} of the Jaco graph denoted by is given by:\\ \\ \\ \\ Further to the above, the concept of the \emph{grog number} of a simple connected directed graph on vertices as well as the general \emph{grog number} of the underlying graph , will be introduced. The \emph{grog number} measures the efficiency of an \emph{optimal predator-prey strategy} if the simple directed graph models an ecological predator-prey web.\\ \\ We also pose four open problems for exploratory research.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.