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

关于超立方体的星荫度

On the star arboricity of hypercubes

Negin Karisani, E. S. Mahmoodian, Narges K. Sobhani

摘要:

超立方体$Q_n$是一个图,其中的顶点都是长度为n的二进制向量,并且两个顶点相邻当且仅当它们的分量恰好在一个位置不同。一个星系或一个恒星森林是一个顶点不相交的恒星联盟。图$G$的星荫度,即${\rm sa}(G)$,是划分图$G$边集的最小星系数。在本文中的其他结果中,我们确定了$n \in \{2^k-3, 2^k+1, 2^k+2, 2^i+2^j-4\}$,$i \geq j \geq 2$的${\rm sa}(Q_n)$的精确值。我们还改进了${\rm sa}(Q_n)$的上界,并证明了${\rm sa}(G)$与平方染色的关系.

英文摘要:

A Hypercube $Q_n$ is a graph in which the vertices are all binary vectors of length n, and two vertices are adjacent if and only if their components differ in exactly one place. A galaxy or a star forest is a union of vertex disjoint stars. The star arboricity of a graph $G$, ${\rm sa}(G)$, is the minimum number of galaxies which partition the edge set of $G$. In this paper among other results, we determine the exact values of ${\rm sa}(Q_n)$ for $n \in \{2^k-3, 2^k+1, 2^k+2, 2^i+2^j-4\}$, $i \geq j \geq 2$. We also improve the last known upper bound of ${\rm sa}(Q_n)$ and show the relation between ${\rm sa}(G)$ and square coloring.

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

↑