Contemplating some invariants of the Jaco Graph, Jn(1),n∈NJ_n(1), n \in \Bbb N

preprint2014arXivOpen access

Abstract

Kok et.al. [7] introduced Jaco Graphs (\emph{order 1}). In this essay we present a recursive formula to determine the \emph{independence number} α(Jn(1))=∣I∣α(J_n(1)) = |\Bbb I| with, I={vi,j∣v1=v1,1∈I\Bbb I = \{v_{i,j}| v_1 = v_{1,1} \in \Bbb I and vi=vi,j=v(d+(vm,(j−1))+m+1)}.v_i = v_{i,j} =v_{(d^+(v_{m, (j-1)}) + m +1)}\}. We also prove that for the Jaco Graph, Jn(1),n∈NJ_n(1), n \in \Bbb N with the prime Jaconian vertex viv_i the chromatic number, χ(Jn(1))χ(J_n(1)) is given by: \begin{equation*} χ(J_n(1)) \begin{cases} = (n-i) + 1, &\text{if and only if the edge vivnv_iv_n exists,}\\ \\ = n-i &\text{otherwise.} \end{cases} \end{equation*} We further our exploration in respect of \emph{domination numbers, bondage numbers} and declare the concept of the \emph{murtage number} of a simple connected graph GG, denoted m(G)m(G). We conclude by proving that for any Jaco Graph Jn(1),n∈NJ_n(1), n \in \Bbb N we have that 0≤m(Jn(1))≤3.0 \leq m(J_n(1)) \leq 3.

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.