The following pages link to (Q5617561):
Displaying 10 items.
- 2-walk-regular graphs with a small number of vertices compared to the valency (Q501214) (← links)
- A characterization of Johnson and Hamming graphs and proof of Babai's conjecture (Q1984524) (← links)
- Using symbolic computation to prove nonexistence of distance-regular graphs (Q1991433) (← links)
- Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations (Q2133641) (← links)
- On near polygons all whose hexes are dual polar spaces (Q2191261) (← links)
- Distance mean-regular graphs (Q2364624) (← links)
- A note on distance-regular graphs with a small number of vertices compared to the valency (Q2444727) (← links)
- The completion of the classification of the finite dense near \(2d\)-gons, \(d \in \{3,4\}\), with four points on each line (Q2685329) (← links)
- New Tools for Graph Coloring (Q3088076) (← links)
- \(m\)-distance-regular graphs and their relation to multivariate \(P\)-polynomial association schemes (Q6611731) (← links)
