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

图幂的 Shannon 容量

The Shannon capacity of graph powers

Eindhoven University of Technology(埃因霍温理工大学);Universitat Politècnica de Catalunya(加泰罗尼亚理工大学);Barcelona Graduate School of Mathematics(巴塞罗那数学研究生学院)

Aida Abiad, Cristina Dalfó, Miquel Àngel Fiol

AI总结:

本文利用谱图理论与线性优化研究图幂的 Shannon 容量上界,推广 Lovász 的比值型结果,并提出可由简单算法计算的多项式所确定的秩型界,辅以实验验证其紧性。

摘要:

对于图 $G$,其第 $k$ 次图幂 $G^k$ 的构造方式是:当两个顶点之间的距离不超过 $k$ 时,在它们之间放置一条边。我们考虑利用谱图理论和线性优化方法推导图幂 Shannon 容量上界的问题。首先,我们使用所谓的比值型界,对 Lovász [IEEE Trans. Inform. Theory 1979] 的一项结果给出另一种谱证明;该结果表明,对于正则图,独立数的 Hoffman 比值界也是 Lovász theta 数的上界,因此也是 Shannon 容量的上界。事实上,我们证明 Lovász 的结果在更一般的图幂情形中仍然成立。其次,我们推导了图幂 Shannon 容量的另一个界,即所谓的秩型界,它依赖于一族可通过运行简单算法计算的新多项式。最后,我们提供了若干计算实验,以证明所提出的两个代数界的尖锐性。作为副产品,当这两个新的代数界是紧的时,它们可用于轻松推导相应图幂的 Lovász theta 数(依赖于求解一个 SDP)和 Shannon 容量(尚不知道是否可计算)的精确值。

英文摘要:

For a graph $G$, its $k$-th graph power $G^k$ is constructed by placing an edge between two vertices if they are within distance $k$. We consider the problem of deriving upper bounds on the Shannon capacity of graph powers by using spectral graph theory and linear optimization methods. First, we use the so-called ratio-type bound to provide an alternative and spectral proof of a result by Lovász [IEEE Trans. Inform. Theory 1979], which states that, for a regular graph, the Hoffman ratio bound on the independence number is also an upper bound on the Lovász theta number and, hence, also on the Shannon capacity. In fact, we show that Lovász' result holds in the more general context of graph powers. Secondly, we derive another bound on the Shannon capacity of graph powers, the so-called rank-type bound, which depends on a new family of polynomials that can be computed by running a simple algorithm. Lastly, we provide several computational experiments that demonstrate the sharpness of the two proposed algebraic bounds. As a byproduct, when these two new algebraic bounds are tight, they can be used to easily derive the exact values of the Lovász theta number (which relies on solving an SDP) and the Shannon capacity (which is not known to be computable) of the corresponding graph power.

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

↑