Pages that link to "Item:Q1010738"
From MaRDI portal
The following pages link to Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes (Q1010738):
Displaying 4 items.
- Strongly regular graphs with non-trivial automorphisms (Q615990) (← links)
- A computer-assisted proof of the uniqueness of the Perkel graph (Q1766104) (← links)
- Computing distance-regular graph and association scheme parameters in \texttt{SageMath} with \texttt{sage}-\texttt{drg} (Q2306451) (← links)
- Classification of three-class association schemes using backtracking with dynamic variable ordering (Q2570104) (← links)