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 α 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.