Closed walks and eigenvalues of abelian Cayley graphs (Q2499662): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Random Cayley graphs and expanders / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the extreme eigenvalues of regular graphs. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4787524 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sums of Multinomial Coefficients / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Spectral estimates for abelian Cayley graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ramanujan graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tight estimates for eigenvalues of regular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Character sums and abelian Ramanujan graphs (with an appendix by Keqin Feng and Wen-Ch'ing Winnie Li) / rank | |||
Normal rank |
Latest revision as of 18:05, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Closed walks and eigenvalues of abelian Cayley graphs |
scientific article |
Statements
Closed walks and eigenvalues of abelian Cayley graphs (English)
0 references
14 August 2006
0 references
Serre proved, for each \(\varepsilon>0\) and each positive integer \(k\), there exists a positive constant \(c=c(\varepsilon,k)\) such that for any \(k\)-regular graph \(X\) the number of eigenvalues \(\lambda_i\) of \(X\) with \(\lambda_i\geq(2-\varepsilon) \sqrt{k-1}\) is at least \(c|X|\). The author proves the following Serre type theorem for abelian Cayley graphs: For each \(\varepsilon>0\) and each positive integer \(k\), there exists a positive constant \(C=C(\varepsilon,k)\) such that for any abelian group \(G\) and for any symmetric set \(S\) of elements of \(G\) with \(|S|=k\) and \(1 \not\in S\), the number of eigenvalues of the Cayley graph \(X=X(G, S)\) such that \(\lambda_i\geq k-\varepsilon\) is at least \(C\cdot|G|\). This result follows from the fact that Cayley graphs of abelian groups have a large number of closed walks of even length.
0 references