Ramanujan graph

Known as: Ramanujan graphs

In spectral graph theory, a Ramanujan graph, named after Srinivasa Ramanujan, is a regular graph whose spectral gap is almost as large as possible…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

Let l be an odd prime. We will construct a tower of connected regular Ramanujan graph of degree l+1 from of modular curves. This…

2017

Cayley hash functions are a family of cryptographic hash functions constructed from Cayley graphs, with appealing properties such…

2017

We show that every monic polynomial of degree three with complex coefficients and no repeated roots is either a (vertical and…

2016

A basic eigenvalue bound due to Alon and Boppana holds only for regular graphs. In this paper we give a generalized Alon-Boppana…

2013

A connected $\rho$-regular graph $G$ has largest eigenvalue $\rho$ in modulus. $G$ is called Ramanujan if it has at least $3…

2007

A graph G is generically [4] rigid in dimension one if and only if it contains a spanning tree, that is, a spanning subgraph…

2007

We are especially interested in graphs – or better, in sequences of graphs – whose first eigenvalues λ1 are relatively small. In…

2004

Cryptographic applications using an elliptic curve over a finite field filter curves for suitability using their order as the…

2001

According to the Langlands program, L-functions arising from families of exponential sums over global function elds are…

1997

We aim here to show how some known Ramanujan Cayley graphs yield error-correcting codes that are asymptotically optimal in the…