Pages that link to "Item:Q1991433"
From MaRDI portal
The following pages link to Using symbolic computation to prove nonexistence of distance-regular graphs (Q1991433):
Displaying 9 items.
- sage-drg (Q38144) (← links)
- On some recent progress in the classification of (\(P\) and \(Q\))-polynomial association schemes (Q2023761) (← links)
- A survey of semisimple algebras in algebraic combinatorics (Q2065326) (← links)
- Inverse problems in the class of distance-regular graphs of diameter 4 (Q2095491) (← links)
- On tight 4-designs in Hamming association schemes (Q2216921) (← links)
- Computing distance-regular graph and association scheme parameters in \texttt{SageMath} with \texttt{sage}-\texttt{drg} (Q2306451) (← links)
- Implications of vanishing Krein parameters on Delsarte designs, with applications in finite geometry (Q2695967) (← links)
- On few-class Q-polynomial association schemes: feasible parameters and nonexistence results (Q5156012) (← links)
- A characterization of the Grassmann graphs (Q6661599) (← links)
