The following pages link to (Q4000288):
Displaying 50 items.
- A family of antipodal distance-regular graphs related to the classical Preparata codes (Q1898150) (← links)
- Uniqueness of strongly regular graphs having minimal \(p\)-rank (Q1899393) (← links)
- Generalized quadrangles with a regular point and association schemes (Q1899398) (← links)
- Star partitions and regularity in graphs (Q1899409) (← links)
- Krein conditions for coherent configurations (Q1899428) (← links)
- Regular automorphism groups on partial geometries (Q1918198) (← links)
- Codes from incidence matrices of graphs (Q1951220) (← links)
- A problem concerning graphs with just three distinct eigenvalues (Q1987019) (← links)
- On the clique number of a strongly regular graph (Q1991424) (← links)
- Special LCD codes from Peisert and generalized Peisert graphs (Q2000556) (← links)
- \(s\)-elusive codes in Hamming graphs (Q2034987) (← links)
- On the commuting graph of semidihedral group (Q2049019) (← links)
- On the classification of binary completely transitive codes with almost-simple top-group (Q2080231) (← links)
- Substitutes for the non-existent square lattice designs for 36 varieties (Q2084363) (← links)
- Signed graphs whose spectrum is bounded by \(- 2\) (Q2113716) (← links)
- A modular first formalisation of combinatorial design theory (Q2128787) (← links)
- On the metric basis in wheels with consecutive missing spokes (Q2132183) (← links)
- More on signed graphs with at most three eigenvalues (Q2158204) (← links)
- Approximate unitary 3-designs from transvection Markov chains (Q2168080) (← links)
- Quasi-balanced weighing matrices, signed strongly regular graphs and association schemes (Q2168927) (← links)
- Arc-transitive groups of automorphisms of antipodal distance-regular graphs of diameter 3 in affine case (Q2182226) (← links)
- Janko sporadic group \(\mathrm{J}_2\) as automorphism group of 3-designs (Q2214041) (← links)
- Inverse problems of graph theory: graphs without triangles (Q2227043) (← links)
- Local WL invariance and hidden shades of regularity (Q2235273) (← links)
- Parametric restrictions on quasi-symmetric designs (Q2237862) (← links)
- Metric dimension of crystal cubic carbon structure (Q2240176) (← links)
- On the support designs of extremal binary doubly even self-dual codes (Q2249783) (← links)
- On bipartite graphs with complete bipartite star complements (Q2250923) (← links)
- Automorphisms of a graph with intersection array \(\{99, 84, 1; 1, 14, 99\}\) (Q2254098) (← links)
- Conditions for the parameters of the block graph of quasi-symmetric designs (Q2256133) (← links)
- 2-neighbour-transitive codes with small blocks of imprimitivity (Q2294111) (← links)
- Partial difference sets in \(C_{2^n} \times C_{2^n}\) (Q2297723) (← links)
- Partition-balanced families of codes and asymptotic enumeration in coding theory (Q2299619) (← links)
- Minimal binary 2-neighbour-transitive codes (Q2299621) (← links)
- Automorphisms of a strongly regular graph with parameters \((1305, 440, 115, 165)\) (Q2317368) (← links)
- Almost designs and their links with balanced incomplete block designs (Q2324778) (← links)
- Eigenvalue multiplicity in regular graphs (Q2328082) (← links)
- On groups whose commuting graph on a transversal is strongly regular (Q2329212) (← links)
- Computing the metric dimension of gear graphs (Q2333612) (← links)
- Computing metric dimension and metric basis of 2D lattice of alpha-boron nanotubes (Q2333632) (← links)
- The largest Erdős-Ko-Rado sets in \(2-(v,k,1)\) designs (Q2345921) (← links)
- Weighted association schemes, fusions, and minimal coherent closures (Q2346762) (← links)
- Strongly regular graphs with the \(7\)-vertex condition (Q2346763) (← links)
- \(\mathbb {Z}_{4}\)-codes and their Gray map images as orthogonal arrays (Q2364629) (← links)
- Cyclotomic matrices over the Eisenstein and Gaussian integers (Q2376713) (← links)
- A design and a geometry for the group Fi\(_{22}\) (Q2384025) (← links)
- Tournaments, 4-uniform hypergraphs, and an exact extremal result (Q2399352) (← links)
- Automorphisms of graphs with intersection arrays \(\{60, 45, 8; 1, 12, 50\}\) and \(\{49, 36, 8; 1, 6, 42\}\) (Q2401659) (← links)
- The graph \(\operatorname{Kre}(4)\) does not exist (Q2411795) (← links)
- Multi-part balanced incomplete-block designs (Q2423168) (← links)
