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} with, and We also prove that for the Jaco Graph, with the prime Jaconian vertex the chromatic number, is given by: \begin{equation*} χ(J_n(1)) \begin{cases} = (n-i) + 1, &\text{if and only if the edge 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 , denoted . We conclude by proving that for any Jaco Graph we have that
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.