Examples of computer experimentation in algebraic combinatorics
From MaRDI portal
Recommendations
- Links between two semisymmetric graphs on 112 vertices via association schemes
- Some combinatorial results first found using computer algebra
- scientific article; zbMATH DE number 1273665
- On a computer algebra technology
- Sporadic examples of directed strongly regular graphs obtained by computer algebra experimentation
Cited in
(10)- Using symbolic computation to prove nonexistence of distance-regular graphs
- A non-Schurian coherent configuration on 14 points exists
- Implementing Brouwer's database of strongly regular graphs
- The Paulus-Rozenfeld-Thompson graph on 26 vertices revisited and related combinatorial structures
- scientific article; zbMATH DE number 3865179 (Why is no real title available?)
- Links between two semisymmetric graphs on 112 vertices via association schemes
- On the existence of self-complementary and non-self-complementary strongly regular graphs with Paley parameters
- Enumeration of coherent configurations of order at most 15
- scientific article; zbMATH DE number 7068502 (Why is no real title available?)
- Geometric groups of second order and related combinatorial structures
This page was built for publication: Examples of computer experimentation in algebraic combinatorics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3085031)
