论文信息 - A spectral bound for vertex-transitive graphs

A spectral bound for vertex-transitive graphs

For any finite, undirected, non-bipartite, vertex-transitive graph, we establish an explicit lower bound for the smallest eigenvalue of its normalised adjacency operator, which depends on the graph only through its degree and its isoperimetric constant.

Arindam Biswas | Jyoti Prakash Saha

[1] Prasad Tetali,et al. On the Bipartiteness Constant and Expansion of Cayley Graphs , 2020, ArXiv.

[2] Arindam Biswas,et al. On a Cheeger type inequality in Cayley graphs of finite groups , 2018, Eur. J. Comb..

[3] N. Alon,et al. il , , lsoperimetric Inequalities for Graphs , and Superconcentrators , 1985 .

[4] Arindam Biswas,et al. A Cheeger type inequality in finite Cayley sum graphs , 2019 .

[5] T. Tao,et al. Expansion in finite simple groups of Lie type , 2013, 1309.1975.