Ramanujan graphs (Q1112836)
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: Ramanujan graphs |
scientific article; zbMATH DE number 4079458
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Ramanujan graphs |
scientific article; zbMATH DE number 4079458 |
Statements
Ramanujan graphs (English)
0 references
1988
0 references
A \(k\)-regular graph on \(n\) vertices is called Ramanujan graph if \(|\lambda|\leq 2\cdot\sqrt{k-1}\), where \(\lambda\) is the largest eigenvalue of its adjacency matrix. These graphs yield best known explicit expanders. The paper contains a large variety of results concerning nontrivial extremal combinatorial properties of Ramanujan and related graphs.
0 references
Ramanujan graph
0 references
expanders
0 references
combinatorial properties
0 references
0 references
