English

A Cheeger type inequality in finite Cayley sum graphs

Combinatorics 2019-07-23 v2 Group Theory

Abstract

Let GG be a finite group and SS be a symmetric generating set of GG with S=d|S| = d. We show that if the undirected Cayley sum graph CΣ(G,S)C_{\Sigma}(G,S) is an expander graph and is non-bipartite, then the spectrum of its normalised adjacency operator is bounded away from 1-1. We also establish an explicit lower bound for the spectrum of these graphs, namely, the non-trivial eigenvalues of the normalised adjacency operator lies in the interval (1+h(G)4η,1h(G)22d2]\left(-1+\frac{h(G)^{4}}{\eta}, 1-\frac{h(G)^{2}}{2d^{2}}\right], where h(G)h(G) denotes the (vertex) Cheeger constant of the dd-regular graph CΣ(G,S)C_{\Sigma}(G,S) and η=29d8\eta = 2^{9}d^{8}. Further, we improve upon a recently obtained bound on the non-trivial spectrum of the normalised adjacency operator of the non-bipartite Cayley graph C(G,S)C(G,S).

Keywords

Cite

@article{arxiv.1907.07710,
  title  = {A Cheeger type inequality in finite Cayley sum graphs},
  author = {Arindam Biswas and Jyoti Prakash Saha},
  journal= {arXiv preprint arXiv:1907.07710},
  year   = {2019}
}

Comments

Grant number added