검색 상세

A Cheeger inequality of a distance regular graph using Green's function

초록/요약

We give a Cheeger inequality of distance regular graphs in terms of the smallest positive eigenvalue of the Laplacian and a value alpha(d) which is defined using q-numbers. We can approximate alpha(d) with arbitrarily small positive error beta. The method is to use a Green's function, which is the inverse of the beta-Laplacian. (C) 2013 Elsevier B.V. All rights reserved.

more