Strongly Regular Graphs Derived from Combinatorial Designs

Cited in

(92)

Discrete hyperbolic geometry
A characterization of designs related to the Witt system S(5,8,24)
A survey of some problems in combinatorial designs - a matrix approach
Coherent algebras
On designs with intersection numbers 0 and 2
Quasi-symmetric designs and self-dual codes
The application of invariant theory to the existence of quasi-symmetric designs
Strongly regular designs and coherent configurations of type \([{32\atop\;3}]\)
Inequalities for quasisymmetric designs
Geometric invariants for quasi-symmetric designs
2-designs having an intersection number k-n
\(t{1\over 2}\)-designs
Distances, graphs and designs
Strongly regular graphs having strongly regular subconstituents
Some remarks on subdesigns of symmetric designs
The family of t-designs. Part I
Quasi-residual quasi-symmetric designs
S-quasi-symmetry
Designs with no three mutually disjoint blocks
On subdesigns of symmetric designs
Amorphous association schemes over the Galois rings of characteristic 4
On quasi-symmetric designs
Quasi-symmetric designs and the Smith normal form
The regular two-graph on 276 vertices
Strongly regular graphs
Affine resolvable balanced incomplete block designs: a survey
Special partially balanced incomplete block designs and associated graphs
Codes projectifs à deux poids, caps complets et ensembles de différences
On a class of symmetric designs
On the uniqueness of a regular thin near octagon on 288 vertices (or the semibiplane belonging to the Mathieu group \(M_{12}\))
Quasi-symmetric designs related to the triangular graph
Quasi-symmetric designs and codes meeting the Grey-Rankin bound
Balancedly splittable Hadamard matrices
Equiangular tight frames that contain regular simplices
Equiangular tight frames with centroidal symmetry
The set of values of \(b\) for which there exist block designs with \(b\) blocks
The family of t-designs. II
Johan Jacob Seidel
Non-existence of quasi-symmetric designs with restricted block graphs
Maximal 2-distance sets containing the regular simplex
Grassmannian codes from paired difference sets
Parametric restrictions on quasi-symmetric designs
Conditions for the parameters of the block graph of quasi-symmetric designs
Harmonic equiangular tight frames comprised of regular simplices
Lattices from tight frames and vertex transitive graphs
Polyphase equiangular tight frames and abelian generalized quadrangles
The uniqueness of a distance-regular graph with intersection array \(\{32,27,8,1;1,4,27,32\}\) and related results
Implementing Brouwer's database of strongly regular graphs
Tremain equiangular tight frames
Equiangular tight frames from group divisible designs
Cocyclic Hadamard matrices over Latin rectangles
Inner balance of symmetric designs
On the Golay perfect binary code
Weights of linear codes and strongly regular normed spaces
Intersection properties of finite sets
Equiangular lines
Non existence of triangle free quasi-symmetric designs.
Hadamard equiangular tight frames
The equivalence of two inequalities for quasisymmetric designs
A note on triangle-free quasi-symmetric designs
A family of partial geometric designs from three-class association schemes
Complex equiangular Parseval frames and Seidel matrices containing 𝑝th roots of unity
Lattices of Simplex Type
Quasi-symmetric designs with fixed difference of block intersection numbers
Infinite families of non-embeddable quasi-residual Menon designs
The Moment Map of a Lie Group Representation
On ramsey numbers for books
Complex Hadamard matrices contained in a Bose-Mesner algebra
Finiteness results in triangle-free quasi-symmetric designs
scientific article; zbMATH DE number 7068502 (Why is no real title available?)
Graphs whose normalized Laplacian has three eigenvalues
Construction of strongly regular graphs using affine designs
Some classes of Hadamard matrices with constant diagonal
Some applications of Magma in designs and codes: Oval designs, Hermitian unitals and generalized Reed-Muller codes
Block-circulant complex Hadamard matrices
Partial geometric designs having circulant concurrence matrices
Quasi-symmetric designs with the difference of block intersection numbers two
Non-existence of quasi-symmetric designs having certain pseudo-geometric block graphs
Binary representations of regular graphs
-uniform mixing in discrete quantum walks
The constructions of partially balanced incomplete block designs based on Kneser graphs
Complex Hadamard matrices and strongly regular graphs
Algorithm for describing the Terwilliger and quantum adjacency algebras of a distance-regular graph
SBIBD(4k\({}^ 2,2k^ 2+k,k^ 2+k)\) and Hadamard matrices of order \(4k^ 2\) with maximal excess are equivalent
5-chromatic strongly regular graphs
Large-determinant sign matrices of order 4k+1
A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs
Equiangular lines and covers of the complete graph
Non-derivable strongly regular graphs from quasi-symmetric designs
Binary codes and quasi-symmetric designs
Equiangular tight frames from complex Seidel matrices containing cube roots of unity
Strongly regular graphs with parameters \((4m^{4},2m^{4}+m^{2},m^{4}+m^{2},m^{4}+m^{2})\) exist for all \(m>1\)

This page was built for publication: Strongly Regular Graphs Derived from Combinatorial Designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5595085)