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

组合图和量子图的边连通度与谱隙

Edge connectivity and the spectral gap of combinatorial and quantum graphs

Gregory Berkolaiko, James B. Kennedy, Pavel Kurasov, Delio Mugnolo

摘要:

我们利用有限量子图的边连通度,得到了该图的第一非平凡本征值的若干上、下界,即,使图不连通所需删除的最小边数。在组合图上,著名的Fiedler不等式是一个界,我们给出了一个新的变分证明。在量子图上,相应的界推广了Band和Lévy的一个最近结果。所有的证明都足够一般,以产生相应的估计$p$ -拉普拉斯算子,并允许我们确定极小。基于图的贝蒂数,我们还导出了所有特征值的上界和下界,它们是“渐近正确的”,即与量子图的特征值的Weyl渐近性一致.特别地,对于任意给定的图,下界改进了Friedlander的所有特征值的界,而上界改进了Ariturk的最近结果.我们的估计也被用来推导出的归一化拉普拉斯矩阵的特征值,提高已知的谱图论的界限上的界限。

英文摘要:

We derive a number of upper and lower bounds for the first nontrivial eigenvalue of a finite quantum graph in terms of the edge connectivity of the graph, i.e., the minimal number of edges which need to be removed to make the graph disconnected. On combinatorial graphs, one of the bounds is the well-known inequality of Fiedler, of which we give a new variational proof. On quantum graphs, the corresponding bound generalizes a recent result of Band and Lévy. All proofs are general enough to yield corresponding estimates for the $p$-Laplacian and allow us to identify the minimizers. Based on the Betti number of the graph, we also derive upper and lower bounds on all eigenvalues which are "asymptotically correct", i.e. agree with the Weyl asymptotics for the eigenvalues of the quantum graph. In particular, the lower bounds improve the bounds of Friedlander on any given graph for all but finitely many eigenvalues, while the upper bounds improve recent results of Ariturk. Our estimates are also used to derive bounds on the eigenvalues of the normalized Laplacian matrix that improve known bounds of spectral graph theory.

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

↑