Strongly Regular Graphs Derived from Combinatorial Designs

Cited in

(88)

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

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)