Finite fields and Ramanujan graphs (Q1362096)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finite fields and Ramanujan graphs |
scientific article; zbMATH DE number 1042498
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finite fields and Ramanujan graphs |
scientific article; zbMATH DE number 1042498 |
Statements
Finite fields and Ramanujan graphs (English)
0 references
12 August 1997
0 references
A connected \(k\)-regular graph is called a Ramanujan graph if the modulus of any eigenvalue (of its adjacency matrix), different from \(\pm k\), does not exceed \(2\sqrt{k-1}\). The author gives a new method to construct Ramanujan graphs, and he constructs two new families of Ramanujan graphs.
0 references
Ramanujan graph
0 references
eigenvalue
0 references
0 references
0 references
0.8836724162101746
0 references
