arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1410.8328math.CO
收藏

考虑Jaco图的一些不变量,$J_n(1), n \in \Bbb N$

Contemplating some invariants of the Jaco Graph, $J_n(1), n \in \Bbb N$

Johan Kok, Susanth C

摘要:

Kok等人[7]介绍了Jaco图(\emph{order 1})。本文给出了一个用$\Bbb I = \{v_{i,j}| v_1 = v_{1,1} \in \Bbb I$和$v_i = v_{i,j} =v_{(d^+(v_{m, (j-1)}) + m +1)}\}.$确定$α(J_n(1)) = |\Bbb I|$的递推公式,并证明了对于素雅可比顶点$v_i$的雅可比图$J_n(1), n \in \Bbb N$,其色数$χ(J_n(1))$为:\begin{equation*} χ(J_n(1)) \begin{cases} = (n-i) + 1, &\text{if and only if the edge $v_iv_n$ exists,}\\ \\ = n-i &\text{otherwise.} \end{cases} \end{equation*}进一步讨论了\emph{domination numbers, bondage numbers},并提出了简单连通图$G$的\emph{murtage number}的概念,记作$m(G)$ .我们的结论是,证明对于任何雅科图$J_n(1), n \in \Bbb N$,我们有$0 \leq m(J_n(1)) \leq 3.$

英文摘要:

Kok et.al. [7] introduced Jaco Graphs (\emph{order 1}). In this essay we present a recursive formula to determine the \emph{independence number} $α(J_n(1)) = |\Bbb I|$ with, $\Bbb I = \{v_{i,j}| v_1 = v_{1,1} \in \Bbb I$ and $v_i = v_{i,j} =v_{(d^+(v_{m, (j-1)}) + m +1)}\}.$ We also prove that for the Jaco Graph, $J_n(1), n \in \Bbb N$ with the prime Jaconian vertex $v_i$ the chromatic number, $χ(J_n(1))$ is given by: \begin{equation*} χ(J_n(1)) \begin{cases} = (n-i) + 1, &\text{if and only if the edge $v_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 $G$, denoted $m(G)$. We conclude by proving that for any Jaco Graph $J_n(1), n \in \Bbb N$ we have that $0 \leq m(J_n(1)) \leq 3.$

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑