Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
