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

由最小边团覆盖导出图的维数

The Inductive Graph Dimension from The Minimum Edge Clique Cover

Kassahun Betre, Evatt Salinger

摘要:

本文证明了两个图的联的递归(Knill)维数有一个简单的公式:$\mathrm{dim\,} (G_1+G_2) = 1 +\mathrm{dim\,} G_1+ \mathrm{dim\,} G_2$ .利用这个公式,我们导出了一个图的最小团覆盖的Knill维数的表达式。该公式的一个推论是,由相同阶$N$的完全图$K_N$的任意并集构成的图将具有维数$N-1$。最后,我们找到了一个图的Knill维数的下限和上界。

英文摘要:

In this paper we prove that the recursive (Knill) dimension of the join of two graphs has a simple formula in terms of the dimensions of the component graphs: $\mathrm{dim\,} (G_1+G_2) = 1 +\mathrm{dim\,} G_1+ \mathrm{dim\,} G_2$. We use this formula to derive an expression for the Knill dimension of a graph from its minimum clique cover. A corollary of the formula is that a graph made of the arbitrary union of complete graphs $K_N$ of the same order $N$ will have dimension $N-1$. We finish by finding lower and upper bounds on the Knill dimension of a graph in terms of its clique number.

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

↑