Competition Graphs of Jaco Graphs and the Introduction of the Grog Number of a Simple Connected Graph

preprint2015arXivOpen access

Abstract

Let G→G^\rightarrow be a simple connected directed graph on n≥2n \geq 2 vertices and let V∗V^* be a non-empty subset of V(G→)V(G^\rightarrow) and denote the undirected subgraph induced by V∗V^* by, ⟨V∗⟩.\langle V^* \rangle. We show that the \emph{competition graph} of the Jaco graph Jn(1),n∈N,n≥5,J_n(1), n \in \Bbb N, n \geq 5, denoted by C(Jn(1))C(J_n(1)) is given by:\\ \\ C(Jn(1))=⟨V∗⟩V∗={vi∣3≤i≤n−1}−{vivmi∣mi=i+dJn(1)+(vi),3≤i≤n−2}∪{v1,v2,vn}.C(J_n(1)) = \langle V^* \rangle_{V^* = \{v_i|3 \leq i \leq n-1\}} - \{v_iv_{m_i}| m_i = i + d^+_{J_n(1)}(v_i), 3 \leq i \leq n-2\} \cup \{v_1, v_2, v_n\}.\\ \\ Further to the above, the concept of the \emph{grog number} g(G→)g(G^\rightarrow) of a simple connected directed graph G→G^\rightarrow on n≥2n \geq 2 vertices as well as the general \emph{grog number} of the underlying graph GG, 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.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.