The following pages link to (Q4273617):
Displaying 32 items.
- Links between two semisymmetric graphs on 112 vertices via association schemes (Q432745) (← links)
- AS-configurations and skew-translation generalised quadrangles (Q468706) (← links)
- On the existence of self-complementary and non-self-complementary strongly regular graphs with Paley parameters (Q506935) (← links)
- Schur rings and non-symmetric association schemes on 64 vertices (Q712248) (← links)
- Infinite families of directed strongly regular graphs using equitable partitions (Q738851) (← links)
- 5-chromatic strongly regular graphs (Q856856) (← links)
- Distance-regular graphs with complete multipartite \(\mu\)-graphs and AT4 family (Q884815) (← links)
- Orderly algorithm to enumerate central groupoids and their graphs (Q884884) (← links)
- Higmanian rank-5 association schemes on 40 points (Q1024880) (← links)
- A new distance-regular graph associated to the Mathieu group \(M_{10}\) (Q1272896) (← links)
- Non-Cayley vertex-transitive graphs of order twice the product of two odd primes (Q1312995) (← links)
- Automorphism groups of \(k\)-arc transitive covers. (Q1422432) (← links)
- Tight 2-designs and perfect 1-codes in Doob graphs (Q1569871) (← links)
- On panel-regular \(\tilde{A}_2\) lattices (Q1681812) (← links)
- Covering radius for sets of permutations (Q1779486) (← links)
- Computers and discovery in algebraic graph theory (Q1855400) (← links)
- More mutually disjoint Steiner systems \(S(5,8,24)\) (Q1873823) (← links)
- Efficient exhaustive listings of reversible one dimensional cellular automata (Q1884849) (← links)
- Extended generalized octagons and the group \(He\) (Q1900054) (← links)
- Extending polar spaces of rank at least 3 (Q1903006) (← links)
- An algorithmic approach to fundamental groups and covers of combinatorial cell complexes (Q1971493) (← links)
- A non-Schurian coherent configuration on 14 points exists (Q2364639) (← links)
- New mixed Moore graphs and directed strongly regular graphs (Q2407033) (← links)
- An efficient algorithm for testing goal-minimality of graphs (Q2446346) (← links)
- Classification of highly symmetrical translation loops of order \(2p\), \(p\) prime. (Q2452344) (← links)
- Computing subgroup presentations, using the coherence arguments of McCammond and Wise. (Q2496857) (← links)
- Association schemes on 28 points as mergings of a half-homogeneous coherent configuration (Q2643847) (← links)
- The Paulus–Rozenfeld–Thompson Graph on 26 Vertices Revisited and Related Combinatorial Structures (Q3296726) (← links)
- Links between Latin squares, nets, graphs and groups: Work inspired by a paper of A. Barlotti and K. Strambach (Q3439402) (← links)
- Ground resolution with group computations on semantic symmetries (Q4647542) (← links)
- Presentations of some 3-transposition groups (Q4834923) (← links)
- (Q5383191) (← links)
