Ramanujan signing of regular graphs

Yonatan Bilu*, Nathan Linial

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

An approach to find an elementary construction of Ramanujan graphs was discussed. The constructions were based on deep results concerning certain number-theoretic conjectures by Ramanujan. Therefore, such graphs are called Ramanujan. It was found that every graph G of maximal degree d has a signing s with spectral radius.

Original languageAmerican English
Pages (from-to)911-912
Number of pages2
JournalCombinatorics Probability and Computing
Volume13
Issue number6
DOIs
StatePublished - Nov 2004

Fingerprint

Dive into the research topics of 'Ramanujan signing of regular graphs'. Together they form a unique fingerprint.

Cite this