Abstract
We give a new method to construct Ramanujan graphs and apply it to define two new families of Ramanujan graphs. These new graphs have a very easy description and we prove that they are Ramanujan graphs in an elementary way. © 1997 Academic Press.
Cite
CITATION STYLE
APA
Arias De Reyna, J. (1997). Finite fields and Ramanujan graphs. Journal of Combinatorial Theory. Series B, 70(2), 259–264. https://doi.org/10.1006/jctb.1996.1740
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free