A Cheeger inequality of a distance regular graph using Green's function
A Cheeger inequality of a distance regular graph using Green's function
复制标题
DOI：
10.1016/j.disc.2013.06.012
复制
发表时间：
2013-10
期刊：
影响因子：
--
通讯作者：
G. C. Kim;Yoonjin Lee
中科院分区：
文献类型：
--
作者：
G. C. Kim;Yoonjin Lee
利用Laplacian的最小正特征值和用q-数定义的值α d，给出了距离正则图的Cheeger不等式.我们可以用任意小的正误差β来近似α d。该方法是使用一个绿色函数，这是反β-拉普拉斯。
We give a Cheeger inequality of distance regular graphs in terms of the smallest positive eigenvalue of the Laplacian and a value α d which is defined using q-numbers. We can approximate α d with arbitrarily small positive error β. The method is to use a Green’s function, which is the inverse of the β-Laplacian.