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

图的Eigenvalue交织与权参数

Eigenvalue interlacing and weight parameters of graphs

M. A. Fiol

摘要:

特征值交错是一种用于推导代数组合学结果的通用技术。特别是,它已被成功地用于证明一些结果之间的关系(邻接矩阵或拉普拉斯)谱的图和它的一些性质。例如,正则划分的一些特征,以及一些参数的界,如独立性和色数,直径,带宽等,已经获得。对于图的每个参数涉及一些顶点集的基数,我们可以通过给顶点一些“权”(即正特征向量的项)并将基数替换为平方范数来定义其相应的权参数。关键点是这样的权重“正则化”了图,因此允许我们定义一种用于一般图的正则划分,称为“伪正则”。在这里,我们展示了如何使用隔行扫描来证明图的一些权重参数和伪正则划分的结果。例如,推广了Lovász的一个著名结果,证明了具有$n$顶点和(邻接矩阵)特征值$λ_1>λ_2\ge\...\ge λ_n$的连通图$\G$的权重香农容量$Θ^*$满足$$ Θ\le Θ^* \le \frac{\|\vecnu\|^2}{1-\frac{λ_1}{λ_n}} $$,其中$Θ$是(标准)香农容量,$\vecnu$是归一化为具有最小条目1的正特征向量。在正则图的特殊情况下,得到的结果有一些有趣的推论,如距离正则图的一些特征值的重数的上界。最后,得到了一些关于Laplacian谱的结果。光谱是衍生的。

英文摘要:

Eigenvalue interlacing is a versatile technique for deriving results in algebraic combinatorics. In particular, it has been successfully used for proving a number of results about the relation between the (adjacency matrix or Laplacian) spectrum of a graph and some of its properties. For instance, some characterizations of regular partitions, and bounds for some parameters, such as the independence and chromatic numbers, the diameter, the bandwidth, etc., have been obtained. For each parameter of a graph involving the cardinality of some vertex sets, we can define its corresponding weight parameter by giving some "weights" (that is, the entries of the positive eigenvector) to the vertices and replacing cardinalities by square norms. The key point is that such weights "regularize" the graph, and hence allow us to define a kind of regular partition, called "pseudo-regular," intended for general graphs. Here we show how to use interlacing for proving results about some weight parameters and pseudo-regular partitions of a graph. For instance, generalizing a well-known result of Lovász, it is shown that the weight Shannon capacity $Θ^*$ of a connected graph $\G$, with $n$ vertices and (adjacency matrix) eigenvalues $λ_1>λ_2\ge\...\ge λ_n$, satisfies $$ Θ\le Θ^* \le \frac{\|\vecnu\|^2}{1-\frac{λ_1}{λ_n}} $$ where $Θ$ is the (standard) Shannon capacity and $\vecnu$ is the positive eigenvector normalized to have smallest entry 1. In the special case of regular graphs, the results obtained have some interesting corollaries, such as an upper bound for some of the multiplicities of the eigenvalues of a distance-regular graph. Finally, some results involving the Laplacian spectrum are derived. spectrum are derived.

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

↑