The following pages link to (Q3218138):
Displayed 50 items.
- The extendability of matchings in strongly regular graphs (Q405235) (← links)
- On a family of strongly regular graphs with \(\lambda = 1\) (Q463295) (← links)
- Codes from lattice and related graphs, and permutation decoding (Q602759) (← links)
- Comparison of two techniques for proving nonexistence of strongly regular graphs (Q659689) (← links)
- Regular star complements in strongly regular graphs (Q665967) (← links)
- On the \(p\)-rank of the adjacency matrices of strongly regular graphs (Q685993) (← links)
- The non-existence of certain skew-symmetric amorphous association schemes (Q709237) (← links)
- Classifying strongly regular graphs using lexical ordering of adjacency matrices (Q757086) (← links)
- On a conjecture of Brouwer involving the connectivity of strongly regular graphs (Q765871) (← links)
- On the 486-vertex distance-regular graphs of Koolen-Riebeek and Soicher (Q783063) (← links)
- On the dual binary codes of the triangular graphs (Q854829) (← links)
- Jack van Lint (1932--2004): a survey of his scientific work (Q855858) (← links)
- 5-chromatic strongly regular graphs (Q856856) (← links)
- A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs (Q871281) (← links)
- Non-derivable strongly regular graphs from quasi-symmetric designs (Q898137) (← links)
- Permutation decoding for binary codes from lattice graphs (Q924975) (← links)
- A construction of non-isomorphic amorphous association schemes from pseudo-cyclic association schemes (Q924986) (← links)
- On the existence of equiangular tight frames (Q996316) (← links)
- On self-complementary strongly regular graphs (Q1101463) (← links)
- Strongly regular designs and coherent configurations of type \([{32\atop\;3}]\) (Q1112048) (← links)
- Interesting pointsets in generalized quadrangles and partial geometries (Q1114693) (← links)
- Characterization theorems for Zara graphs (Q1123911) (← links)
- Galois correspondence between permutation groups and cellular rings (association schemes) (Q1174111) (← links)
- Regular 2-graphs and extensions of partial geometries (Q1174155) (← links)
- Matrix constructions of divisible designs (Q1175275) (← links)
- Partitions in matrices and graphs (Q1176030) (← links)
- New bounds and constructions for authentication/secrecy codes with splitting (Q1176594) (← links)
- Improvement of Bruck's completion theorem (Q1182407) (← links)
- Symmetric divisible designs with \(k-\lambda{}_ 1=1\) (Q1183964) (← links)
- Designs constructed from maximal arcs (Q1184006) (← links)
- Diagram geometries for sharply \(n\)-transitive sets of permutations or of mappings (Q1184510) (← links)
- The dual of Pasch's axiom (Q1185865) (← links)
- Second neighbourhoods of strongly regular graphs (Q1197051) (← links)
- Structure and uniqueness of the \((81,20,1,6)\) strongly regular graph (Q1199584) (← links)
- Subplane covered nets and semipartial geometries (Q1199591) (← links)
- Is Taylor's graph geometric? (Q1199636) (← links)
- Designs as maximum codes in polynomial metric spaces (Q1201908) (← links)
- Skew-symmetric association schemes with two classes and strongly regular graphs of type \(L_{2n-1}(4n-1)\) (Q1201911) (← links)
- Nonregular graphs with three eigenvalues (Q1272482) (← links)
- Three-class association schemes (Q1296390) (← links)
- A survey of partial difference sets (Q1329113) (← links)
- Strongly regular fusions of tensor products of strongly regular graphs (Q1335196) (← links)
- Geometric characterization of the sporadic groups \(Fi_{22}\), \(Fi_{23}\), and \(Fi_{24}\) (Q1336442) (← links)
- Proof of a conjecture of de Caen and van Dam (Q1348746) (← links)
- Partitions of sets of designs on seven, eight and nine points (Q1361668) (← links)
- Simple connectedness of the 3-local geometry of the Monster (Q1368036) (← links)
- Overlarge sets and partial geometries (Q1375942) (← links)
- Graphs with constant \(\mu\) and \(\overline{\mu}\) (Q1379987) (← links)
- Directed strongly regular graphs obtained from coherent algebras (Q1418969) (← links)
- Permutation decoding for the binary codes from triangular graphs. (Q1422399) (← links)