Affordable Access

Publisher Website

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

Authors
Journal
Discrete Mathematics
0012-365X
Publisher
Elsevier
Publication Date
Volume
313
Issue
20
Identifiers
DOI: 10.1016/j.disc.2013.06.012
Keywords
  • Green’S Function
  • Laplacian
  • [Formula Omitted]-Polynomial Scheme
  • Distance Regular Graph
  • Cheeger Constant
  • Cheeger Inequality

Abstract

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.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments