Searching for "On Construction of Almost-Ramanujan Graphs." – sorted by Relevance.
-
Expander Graphs and Gaps between Primes
- consecutive primes, we are able to construct infinite families of “almost” Ramanujan graphs for almost every
- Cited by 1 (0 self) – Add To MetaCart
-
Load Balancing of Unit Size Tokens and Expansion Properties of Graphs
- was improved by Kahale in [20]. He also constructed almost Ramanujan graphs, for which his bound
- Cited by 8 (4 self) – Add To MetaCart

