Ramanujan graph

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

English Wikipedia has an article on:
Wikipedia

Etymology[edit]

Named after mathematician Srinivasa Ramanujan.

Noun[edit]

Ramanujan graph (plural Ramanujan graphs)

  1. (graph theory) A regular graph whose spectral gap is almost as large as possible, making it an excellent spectral expander. Such graphs are relevant to diverse branches of pure mathematics.
Retrieved from "https://en.wiktionary.org/w/index.php?title=Ramanujan_graph&oldid=75386879"