scientific article; zbMATH DE number 3884175
From MaRDI portal
Publication:3218138
zbMATH Open0555.05016MaRDI QIDQ3218138FDOQ3218138
Authors: Andries E. Brouwer, Jack van Lint 
Publication date: 1984
Title of this publication is not available (Why is that?)
Recommendations
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of finite geometries (05B25) Other designs, configurations (05B30)
Cited In (only showing first 100 items - show all)
- A construction of amorphous association scheme from a pseudo-cyclic association scheme
- Overlarge sets and partial geometries
- Association schemes from the action of \(\text{PGL}(2,q)\) fixing a nonsingular conic in \(\text{PG}(2,q)\)
- Regular automorphism groups on partial geometries
- Permutation decoding for the binary codes from triangular graphs.
- Title not available (Why is that?)
- Strongly regular graphs
- The extendability of matchings in strongly regular graphs
- Title not available (Why is that?)
- Binary codes from graphs on triples
- Three-class association schemes
- The non-existence of certain skew-symmetric amorphous association schemes
- 5-chromatic strongly regular graphs
- Strongly regular decompositions of the complete graph
- Comparison of two techniques for proving nonexistence of strongly regular graphs
- On the integrability of strongly regular graphs
- Structure and uniqueness of the \((81,20,1,6)\) strongly regular graph
- Symmetric divisible designs with \(k-\lambda{}_ 1=1\)
- On the dual binary codes of the triangular graphs
- Geometric characterization of the sporadic groups \(Fi_{22}\), \(Fi_{23}\), and \(Fi_{24}\)
- A survey of partial difference sets
- Interesting pointsets in generalized quadrangles and partial geometries
- Matrix constructions of divisible designs
- On the \(p\)-rank of the adjacency matrices of strongly regular graphs
- Graphs with constant \(\mu\) and \(\overline{\mu}\)
- On the existence of equiangular tight frames
- Partitions of sets of designs on seven, eight and nine points
- On a conjecture of Brouwer involving the connectivity of strongly regular graphs
- Strongly regular designs and coherent configurations of type \([{32\atop\;3}]\)
- Designs constructed from maximal arcs
- The dual of Pasch's axiom
- Chromatic invariants for finite graphs: Theme and polynomial variations
- A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs
- Optimality of partial geometric designs
- Nonregular graphs with three eigenvalues
- Jack van Lint (1932--2004): a survey of his scientific work
- Galois correspondence between permutation groups and cellular rings (association schemes)
- New bounds and constructions for authentication/secrecy codes with splitting
- Subplane covered nets and semipartial geometries
- Improvement of Bruck's completion theorem
- A nonregular analogue of conference graphs
- Classifying strongly regular graphs using lexical ordering of adjacency matrices
- Non-derivable strongly regular graphs from quasi-symmetric designs
- Directed strongly regular graphs obtained from coherent algebras
- Strongly regular graphs that are locally a disjoint union of hexagons
- On strongly regular graphs with \(\mu \leq 2\)
- On a family of strongly regular graphs with \(\lambda = 1\)
- Some new cyclotomic strongly regular graphs
- Partitions in matrices and graphs
- Subconstituents of orthogonal graphs of odd characteristic
- Orthogonal graphs over Galois rings of odd characteristic
- Uniqueness of strongly regular graphs having minimal \(p\)-rank
- Proof of a conjecture of de Caen and van Dam
- Graphs with two main and two plain eigenvalues
- Disconnecting strongly regular graphs
- Nonisotropic symplectic graphs over finite commutative rings
- On the 486-vertex distance-regular graphs of Koolen-Riebeek and Soicher
- Strongly regular graphs with parameters (81, 30, 9, 12) and a new partial geometry
- Regular star complements in strongly regular graphs
- On some distance-regular graphs with many vertices
- Characterization theorems for Zara graphs
- A construction of non-isomorphic amorphous association schemes from pseudo-cyclic association schemes
- On self-complementary strongly regular graphs
- Strongly regular \((\alpha,\beta)\)-geometries
- Codes from lattice and related graphs, and permutation decoding
- Combinatorial designs with two singular values. II: Partial geometric designs
- Regular 2-graphs and extensions of partial geometries
- Designs as maximum codes in polynomial metric spaces
- Regular graphs with four eigenvalues
- Equiangular tight frames with centroidal symmetry
- Second neighbourhoods of strongly regular graphs
- Permutation decoding for binary codes from lattice graphs
- Is Taylor's graph geometric?
- A (49,16,3,6) strongly regular graph does not exist
- New strongly regular graphs from finite geometries via switching
- Euclidean Jordan Algebras and Strongly Regular Graphs
- Two characterizations of the grid graphs
- Finding planted subgraphs with few eigenvalues using the Schur-Horn relaxation
- proper partial geometries with an automorphism group acting primitively on points and lines
- On the non-existence of \(\mathrm{srg}(76,21,2,7)\)
- Title not available (Why is that?)
- Uniform mixing and association schemes
- Partial balanced incomplete block designs arising from a maximum independent set of an SRNT graph
- Self-orthogonal codes from row orbit matrices of strongly regular graphs
- Partial geometries, their extensions, and related graphs
- Title not available (Why is that?)
- A spectral characterization of the \(s\)-clique extension of the square grid graphs
- Orthogonal graphs modulo power of 2
- Partitions of sets of two-fold triple systems, and their relations to some strongly regular graphs
- On the locating matrix of a graph and its spectral analysis
- There is no (75,32,10,16) strongly regular graph
- Generalized orthogonal graphs of characteristic a power of 2
- A construction for clique-free pseudorandom graphs
- Partial geometric designs having circulant concurrence matrices
- Strongly regular configurations
- Switching for small strongly regular graphs
- There is no strongly regular graph with parameters \((460, 153, 32, 60)\)
- On Deza graphs with disconnected second neighborhood of a vertex
- Fissioned triangular schemes via the cross-ratio
- A four-class association scheme
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3218138)
