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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1965-2018
051019652018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Recent work by Marcus, Spielman and Srivastava proves the existence of bipartite Ramanujan (multi) graphs of all degrees and all… (More)
Is this relevant?
2016
2016
Let <i>G</i> be a finite connected graph, and let ρ be the spectral radius of its universal cover. For example, if <i>G</i> is <i… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2015
Highly Cited
2015
A non-backtracking walk on a graph is a directed path such that no edge is the inverse of its preceding edge. The non… (More)
  • figure 1
Is this relevant?
Highly Cited
2013
Highly Cited
2013
We prove that there exist infinite families of regular bipartite Ramanujan graphs of every degree bigger than 2. We do this by… (More)
Is this relevant?
2009
2009
A random n-lift of a base graph G is its cover graph H on the vertices [n]×V (G), where for each edge uv in G there is an… (More)
  • figure 1
  • figure 2
Is this relevant?
2009
2009
We consider finite analogues of Euclidean graphs in a more general setting than that considered in [A. Medrano, P. Myers, H.M… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
2007
2007
In this paper, we explore spectral properties of a class of regular Cayley graphs known as Ramanujan graphs and prove that the… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
Is this relevant?
2004
2004
This is a companion paper of “Finite Euclidean graphs and Ramanujan graphs” by the same authors. Finite analogues of the Poincar… (More)
  • table 1
  • table 2
Is this relevant?
2003
2003
We construct an infinite family of (q + 1)−regular Ramanujan graphs Xn of girth 1. We also give covering maps Xn+1 → Xn such that… (More)
  • figure 1
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The spectral method is the best currently known technique to prove lower bounds on expansion. Ramanujan graphs, which have… (More)
Is this relevant?