Explicit Concentrators from Generalized N-Gons

DOI10.1137/0605030zbMath0554.05045WikidataQ105584982 ScholiaQ105584982MaRDI QIDQ3216690

R. Michael Tanner

Publication date: 1984

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0605030

zbMATH Keywords

bipartite graph; eigenvalues; generalized N-gons; concentrators

Mathematics Subject Classification ID

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C40: Connectivity

51E30: Other finite incidence structures (geometric aspects)

Related Items

Unnamed Item, Sparse and limited wavelength conversion in all-optical tree networks, Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory, Highly symmetric expanders, \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators, The spectra of Manhattan street networks, Eigenvalues and expanders, A geometric condition for incidence-matrix nullvectors, Eigenvalues, diameter, and mean distance in graphs, On the second eigenvalue and random walks in random \(d\)-regular graphs, On the spectra of certain graphs arising from finite fields, Expansion properties of Cayley graphs of the alternating groups, Constant time parallel sorting: An empirical view., On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\), Natural bounded concentrators, Tough Ramsey graphs without short cycles, Simulating BPP using a general weak random source, Heegaard splittings, the virtually Haken conjecture and property \((\tau)\), Some elementary Ramanujan graphs, Dense expanders and pseudo-random bipartite graphs, Expander graphs and their applications, Expanders and Diffusers, Diameters and Eigenvalues

Cites Work

• Explicit constructions of linear-sized superconcentrators
• On the complexity of an optimal non-blocking commutation scheme without reorganization
• The nonexistence of certain generalized polygons
• A recursive approach to low complexity codes
• Superconcentrators
• Generalized Connectors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item