Strongly regular graphs
Hadamard matricestriangular graphsGolay codesquare grid graphstransversal designsPayley graphsblock graphs of quasi-symmetric 2-designsnegative Latin square graphsrank 3 graphs classificationsingly laced Dynkin diagramssquare 2-designs with a null polarity
Design of statistical experiments (62Kxx) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to statistics (62-01) Association schemes, strongly regular graphs (05E30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Combinatorial structures in finite projective spaces (51E20) Group actions on combinatorial structures (05E18) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to geometry (51-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to group theory (20-01)
- Switching for small strongly regular graphs
- scientific article; zbMATH DE number 2149410
- scientific article; zbMATH DE number 3884175
- Enumeration of strongly regular graphs on up to 50 vertices having \(S_{3}\) as an automorphism group
- Strongly regular graphs with parameters \((37, 18, 8, 9)\) having nontrivial automorphisms
- scientific article; zbMATH DE number 7068502 (Why is no real title available?)
- Block designs from self-dual codes obtained from Paley designs and Paley graphs
- Separating rank 3 graphs
- Two new classes of projective two-weight linear codes
- Strongly regular configurations
- The Gallai and anti-Gallai graphs of strongly regular graphs
- On quasi-strongly regular graphs with parameters \((n, k, a; k - 2, c_2)\) for \(a < k - 5\)
- Edge-symmetric strongly regular graphs with at most 100 vertices
- Partitioning strongly regular graphs
- Eigenvector components of symmetric, graph-related matrices
- An infinite class of Neumaier graphs and non-existence results
- On some codes from rank 3 primitive actions of the simple Chevalley group \(G_2(q) \)
- A new construction of strongly regular graphs with parameters of the complement symplectic graph
- On the (non-)existence of tight distance-regular graphs: a local approach
- Switching for small strongly regular graphs
- Bounds for regular induced subgraphs of strongly regular graphs
- Implementing Brouwer's database of strongly regular graphs
- Correction to: ``New non-existence proofs for ovoids of Hermitian polar spaces and hyperbolic quadrics
- Strongly regular edge-transitive graphs
- The automorphism group of \(NU(3,q^2)\)
- The subconstituent algebra of strongly regular graphs associated with a Latin square
- Cameron–Liebler sets for maximal totally isotropic flats in classical affine spaces
- On quasi-strongly regular graphs with parameters \((n, k, a; k-2, c_2)\). I
- Approximately strongly regular graphs
- Extremal Peisert-type graphs without the strict-EKR property
- Spectral classes of strongly-regular and distance-regular graphs
- Strongly regular tri-Cayley graphs
- There does not exist a strongly regular graph with parameters \((1911, 270, 105, 27)\)
- The association scheme on the set of flags of a finite generalized quadrangle
- The asymptotics of \(r(4,t)\)
- The nullity and ranks of the lexicographic product of strongly regular graphs
- A geometrical characterization of strongly regular graphs
- scientific article; zbMATH DE number 2235055 (Why is no real title available?)
- Metric dimension of dual polar graphs
- scientific article; zbMATH DE number 3884175 (Why is no real title available?)
- Bounds for the sum of distances of spherical sets of small size
- Random strongly regular graphs?
- Linear codes and cyclic codes over finite rings and their generalizations: a survey
- Two-closure of rank \(3\) groups in polynomial time
- scientific article; zbMATH DE number 2149410 (Why is no real title available?)
- Weyl tensors, strongly regular graphs, multiplicative characters, and a quadratic matrix equation
- The strongly regular twisted \(D_{5 , 5} ( q )\) graph
- On a class of vertex-transitive distance-regular covers of complete graphs. II
- 2-reconstructibility of strongly regular graphs and 2-partially distance-regular graphs
- Genuinely nonabelian partial difference sets
- ON SOME VERTEX-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS
- On strongly walk regular graphs, triple sum sets and their codes
- Constructions of cospectral graphs with different zero forcing numbers
- On intriguing sets in five classes of strongly regular graphs
- The Spectrum of the Grigoriev–Laurent Pseudomoments
- Incidence‐free sets and edge domination in incidence graphs
- Majorana algebra for the Hoffman-Singleton graph
- scientific article; zbMATH DE number 2076941 (Why is no real title available?)
- Quasi-balanced weighing matrices, signed strongly regular graphs and association schemes
- A construction of directed strongly regular graphs with parameters \((63,11,8,1,2)\)
- Symmetry and asymmetry between positive and negative square energies of graphs
- \(m\)-distance-regular graphs and their relation to multivariate \(P\)-polynomial association schemes
- Transitive \((q - 1)\)-fold packings of \(PG_n(q)\)
- Some two-weight codes invariant under the \(3\)-fold covers of the Mathieu groups \(\mathrm{M}_{22}\) and \(\Aut(\mathrm{M}_{22})\)
- On \(G\)-vertex-transitive covers of complete graphs having at most two \(G\)-orbits on the arc set
- On the size of maximal binary codes with 2, 3, and 4 distances
- Vertex-primitive digraphs with large fixity
- Upper bounds for the number of substructures in finite geometries from the container method
- The adjacency codes of the first yellow graphs
- On locally \(n \times n\) grid graphs
- Software for proper vertex-colouring exploiting graph symmetry
- Partial difference sets with Denniston parameters in elementary abelian \(p\)-groups
- Non-canonical maximum cliques without a design structure in the block graphs of 2-designs
- Some locally Kneser graphs
- Convergence rate of Markov chains over switching distance regular networks
- The real equiangular tight frames obtained from rank 3 graphs
This page was built for publication: Strongly regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014286)
