swMATH7516MaRDI QIDQ19543FDOQ19543
Author name not available (Why is that?)
Official website: http://www.maths.qmul.ac.uk/~leonard/grape/
Cited In (only showing first 100 items - show all)
- Coding with injections
- Normal edge-transitive Cayley graphs of Frobenius groups
- Locally triangular graphs and rectagraphs with symmetry
- Groups all of whose undirected Cayley graphs are integral
- Orderly algorithm to enumerate central groupoids and their graphs
- On the simple connectedness of hyperplane complements in dual polar spaces. II.
- \textsc{Spin-to-Grape}: a tool for analysing symmetry in Promela models
- The extensions of the generalized quadrangle of order (3,9)
- Presentations of some 3-transposition groups
- 5-chromatic strongly regular graphs
- Minimal paths in the commuting graphs of semigroups
- Partitions, Kostka polynomials and pairs of trees
- Title not available (Why is that?)
- Schur rings and non-symmetric association schemes on 64 vertices
- Groups all of whose undirected Cayley graphs are determined by their spectra
- The power graph of a finite group
- Title not available (Why is that?)
- Title not available (Why is that?)
- Links between two semisymmetric graphs on 112 vertices via association schemes
- Conics in sextic \(K3\)-surfaces in \(\mathbb{P}^4\)
- Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
- On the non-commuting graph in finite Moufang loops
- Efficient exhaustive listings of reversible one dimensional cellular automata
- Clique-partitioned graphs
- Enumerating partial Latin rectangles
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- Higmanian rank-5 association schemes on 40 points
- An algorithmic approach to fundamental groups and covers of combinatorial cell complexes
- Covering radius for sets of permutations
- Searching for small simple automorphic loops.
- The density of sets avoiding distance 1 in Euclidean space
- GAP
- INGRID
- Cliquer
- QUOTPIC
- DISCRETA
- Spin-to-Grape
- AS-configurations and skew-translation generalised quadrangles
- On cliques in edge-regular graphs
- LOOPS
- DESIGN
- orb
- Traces
- AtlasRep
- Cohcfg
- MINION
- Grappa
- Genss
- FinInG
- SetOrbit
- ATLAS Group Representations
- libexact
- Siamese combinatorial objects via computer algebra experimentation
- Tight 2-designs and perfect 1-codes in Doob graphs
- fundamental
- GRAPH
- coco
- daVinci
- bliss
- singer_lattice
- Digraphs
- COCO2P
- images
- snarkhunter
- Cubefree
- TransGrp
- AUTOMATA
- UnitalSZ
- SmallGrp
- On the structure and classification of SOMAs: Generalizations of mutually orthogonal Latin squares
- Extending polar spaces of rank at least 3
- Schur indices of association schemes
- Numerical measures for two-graphs
- GroupNames
- cgroups
- GraphBacktracking
- New mixed Moore graphs and directed strongly regular graphs
- Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes
- Symmetry in world trade network
- The metric dimension of small distance-regular and strongly regular graphs
- On some distance-regular graphs with many vertices
- Association schemes on 28 points as mergings of a half-homogeneous coherent configuration
- Extended generalized octagons and the group \(He\)
- Non-Cayley vertex-transitive graphs of order twice the product of two odd primes
- On the existence of self-complementary and non-self-complementary strongly regular graphs with Paley parameters
- Counterexamples to Hedetniemi's conjecture with large fractional chromatic numbers
- Examples of computer experimentation in algebraic combinatorics
- On panel-regular \(\tilde{A}_2\) lattices
- Medial layer graphs of equivelar 4-polytopes
- Title not available (Why is that?)
- Uniform semi-Latin squares and their pairwise-variance aberrations
- A new construction of antipodal distance regular covers of complete graphs through the use of Godsil-Hensel matrices
- New constructions of divisible design Cayley graphs
- Enumeration of strongly regular graphs on up to 50 vertices having \(S_{3}\) as an automorphism group
- Computers and discovery in algebraic graph theory
- An efficient algorithm for testing goal-minimality of graphs
- Designs on the web
- Automorphism groups of \(k\)-arc transitive covers.
- Designs, groups and computing
- Self-orthogonal codes from row orbit matrices of strongly regular graphs
This page was built for software: GRAPE
