Abstract

The authors give constructions of Ramanujan graphs from algebraic coding, prime-phase sequences, and combinatorics. The graphs constructed have several advantages. The main advantage is that our constructions use only elementary algebraic methods (as opposed to deeper results from algebraic geometry, number theory, or representation theory) in construction and in determining various parameters, such expansion coefficients, diameters etc. These graphs also are better compared to known graphs in various respects.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.