Pages that link to "Item:Q2449138"
From MaRDI portal
The following pages link to On the sizes of expander graphs and minimum distances of graph codes (Q2449138):
Displaying 7 items.
- Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey (Q2042199) (← links)
- A spectral version of the Moore problem for bipartite regular graphs (Q2278589) (← links)
- Maximizing the order of a regular graph of given valency and second eigenvalue (Q2818201) (← links)
- Graph connectivities, network coding, and expander graphs (Q2848198) (← links)
- (Q3374402) (← links)
- A new formula for the minimum distance of an expander code (Q5884135) (← links)
- (Q6059365) (← links)