Classification of three-class association schemes using backtracking with dynamic variable ordering
From MaRDI portal
Publication:2570104
DOI10.1016/j.disc.2005.06.014zbMath1073.05074OpenAlexW1968301435MaRDI QIDQ2570104
Publication date: 26 October 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.06.014
Related Items (4)
Characterizing distance-regularity of graphs by the spectrum ⋮ On the order of antipodal covers ⋮ INVESTIGATION OF CONTINUOUS-TIME QUANTUM WALKS VIA SPECTRAL ANALYSIS AND LAPLACE TRANSFORM ⋮ Classification of some strongly regular subgraphs of the McLaughlin graph
Uses Software
Cites Work
- Spreads in strongly regular graphs
- Three-class association schemes
- A computer-assisted proof of the uniqueness of the Perkel graph
- The strongly regular (40, 12, 2, 4) graphs
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
- Isomorph-Free Exhaustive Generation
- The pseudo-geometric graphs for generalized quadrangles of order \((3,t)\)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Classification of three-class association schemes using backtracking with dynamic variable ordering
