Ramanujan graphs with small girth

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

We construct an infinite family of (q + 1)-regular Ramanujan graphs X n of girth 1. We also give covering maps Xn+1 → Xn such that the minimal common covering of all the Xn's is the universal covering tree.

Original languageEnglish
Pages (from-to)487-502
Number of pages16
JournalCombinatorica
Volume23
Issue number3
DOIs
StatePublished - 1 Dec 2003
Externally publishedYes

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Computational Mathematics

Fingerprint

Dive into the research topics of 'Ramanujan graphs with small girth'. Together they form a unique fingerprint.

Cite this