arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2301.02820math.COcs.ITmath.IT
收藏

关于Lovász $θ$ -函数、图容量、特征值和强积的观察

Observations on the Lovász $θ$-Function, Graph Capacity, Eigenvalues, and Strong Products

Igal Sason

摘要:

本文对图的Lovász $θ$ -函数给出了新的观察.这些包括一个简单的封闭形式的表达,该功能的所有强正则图,连同上,下界的所有正则图的功能。这些界限用正则图的邻接矩阵的第二大和最小特征值以及等式的充分条件来表示(上限是由Lovász提出的,其次是一个新的充分条件)。这些结果是有用的,在许多方面,导致确定的确切值的香农容量的各种图形,特征值不等式,并在集团和色数的图的界限。由于Lovász $θ$ -函数对图的强积进行因子分解,因此所得结果对图的强积或强幂的参数也特别有用.由此导出了正则图的强积的最小和次大特征值的界,表示为每个因子的Lovász $θ$ -函数(或最小特征值)的函数.由此产生的下界的第二大特征值的$k$倍强功率的正则图相比,阿隆-Boppana界,在一定条件下,新的界限是优越的指数增长性率(在$k$)。利用图的每个因子的阶和Lovász $θ$ -函数,给出了图的强积色数的下界.这些界限的效用举例说明,导致在某些情况下,一个确切的确定的色数的强产品或强大的权力的图形。本研究论文的目的也是为了具有指导价值。

英文摘要:

This paper provides new observations on the Lovász $θ$-function of graphs. These include a simple closed-form expression of that function for all strongly regular graphs, together with upper and lower bounds on that function for all regular graphs. These bounds are expressed in terms of the second-largest and smallest eigenvalues of the adjacency matrix of the regular graph, together with sufficient conditions for equalities (the upper bound is due to Lovász, followed by a new sufficient condition for its tightness). These results are shown to be useful in many ways, leading to the determination of the exact value of the Shannon capacity of various graphs, eigenvalue inequalities, and bounds on the clique and chromatic numbers of graphs. Since the Lovász $θ$-function factorizes for the strong product of graphs, the results are also particularly useful for parameters of strong products or strong powers of graphs. Bounds on the smallest and second-largest eigenvalues of strong products of regular graphs are consequently derived, expressed as functions of the Lovász $θ$-function (or the smallest eigenvalue) of each factor. The resulting lower bound on the second-largest eigenvalue of a $k$-fold strong power of a regular graph is compared to the Alon--Boppana bound; under a certain condition, the new bound is superior in its exponential growth rate (in $k$). Lower bounds on the chromatic number of strong products of graphs are expressed in terms of the order and the Lovász $θ$-function of each factor. The utility of these bounds is exemplified, leading in some cases to an exact determination of the chromatic numbers of strong products or strong powers of graphs. The present research paper is aimed to have tutorial value as well.

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

↑