
Expander graphs are defined and some properties are given. The authors give constructive procedures for families of expander graphs. The graphs are Ramanujan graphs and are shown to have large automorphism groups and are highly symmetric.
:Science::Mathematics::Discrete mathematics::Algorithms [DRNTU], Algebra and Number Theory, Applied Mathematics, expander graphs, switching graphs, symmetric graphs, Theoretical Computer Science, Graph algorithms (graph-theoretic aspects), Graph theory (including graph drawing) in computer science, Applications of graph theory to circuits and networks, Ramanujan graphs, Engineering(all)
:Science::Mathematics::Discrete mathematics::Algorithms [DRNTU], Algebra and Number Theory, Applied Mathematics, expander graphs, switching graphs, symmetric graphs, Theoretical Computer Science, Graph algorithms (graph-theoretic aspects), Graph theory (including graph drawing) in computer science, Applications of graph theory to circuits and networks, Ramanujan graphs, Engineering(all)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
