scientific article
From MaRDI portal
Publication:3218138
zbMath0555.05016MaRDI QIDQ3218138
Andries E. Brouwer, J. H. van Lint
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Other designs, configurations (05B30) Combinatorial aspects of finite geometries (05B25)
Related Items (only showing first 100 items - show all)
A survey of partial difference sets ⋮ A construction of amorphous association scheme from a pseudo-cyclic association scheme ⋮ Strongly regular fusions of tensor products of strongly regular graphs ⋮ Nonisotropic symplectic graphs over finite commutative rings ⋮ Geometric characterization of the sporadic groups \(Fi_{22}\), \(Fi_{23}\), and \(Fi_{24}\) ⋮ A spectral characterization of the \(s\)-clique extension of the square grid graphs ⋮ Proof of a conjecture of de Caen and van Dam ⋮ Disconnecting strongly regular graphs ⋮ Some new cyclotomic strongly regular graphs ⋮ On self-complementary strongly regular graphs ⋮ Uniqueness of strongly regular graphs having minimal \(p\)-rank ⋮ Regular graphs with four eigenvalues ⋮ Chromatic invariants for finite graphs: Theme and polynomial variations ⋮ On the dual binary codes of the triangular graphs ⋮ Jack van Lint (1932--2004): a survey of his scientific work ⋮ On the locating matrix of a graph and its spectral analysis ⋮ 5-chromatic strongly regular graphs ⋮ Partitions of sets of designs on seven, eight and nine points ⋮ Unnamed Item ⋮ Partitions of sets of two-fold triple systems, and their relations to some strongly regular graphs ⋮ Strongly regular designs and coherent configurations of type \([{32\atop\;3}\)] ⋮ Simple connectedness of the 3-local geometry of the Monster ⋮ Interesting pointsets in generalized quadrangles and partial geometries ⋮ Uniform mixing and association schemes ⋮ A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs ⋮ Switching for Small Strongly Regular Graphs ⋮ Overlarge sets and partial geometries ⋮ Regular automorphism groups on partial geometries ⋮ Codes from lattice and related graphs, and permutation decoding ⋮ Graphs with constant \(\mu\) and \(\overline{\mu}\) ⋮ Characterization theorems for Zara graphs ⋮ On Deza graphs with disconnected second neighborhood of a vertex ⋮ On some distance-regular graphs with many vertices ⋮ Quadratic embedding constants of graph joins ⋮ The extendability of matchings in strongly regular graphs ⋮ proper partial geometries with an automorphism group acting primitively on points and lines ⋮ Equiangular tight frames with centroidal symmetry ⋮ Unnamed Item ⋮ Non-derivable strongly regular graphs from quasi-symmetric designs ⋮ Graphs with two main and two plain eigenvalues ⋮ Subconstituents of orthogonal graphs of odd characteristic ⋮ Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation ⋮ On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship ⋮ There Is No Strongly Regular Graph with Parameters (460, 153, 32, 60) ⋮ Directed strongly regular graphs obtained from coherent algebras ⋮ Orthogonal graphs over Galois rings of odd characteristic ⋮ Permutation decoding for the binary codes from triangular graphs. ⋮ A construction for clique-free pseudorandom graphs ⋮ On a family of strongly regular graphs with \(\lambda = 1\) ⋮ Orthogonal graphs modulo power of 2 ⋮ Permutation decoding for binary codes from lattice graphs ⋮ A construction of non-isomorphic amorphous association schemes from pseudo-cyclic association schemes ⋮ Galois correspondence between permutation groups and cellular rings (association schemes) ⋮ Regular 2-graphs and extensions of partial geometries ⋮ Matrix constructions of divisible designs ⋮ Partitions in matrices and graphs ⋮ Comparison of two techniques for proving nonexistence of strongly regular graphs ⋮ New bounds and constructions for authentication/secrecy codes with splitting ⋮ Regular star complements in strongly regular graphs ⋮ Improvement of Bruck's completion theorem ⋮ Symmetric divisible designs with \(k-\lambda{}_ 1=1\) ⋮ Designs constructed from maximal arcs ⋮ Diagram geometries for sharply \(n\)-transitive sets of permutations or of mappings ⋮ The dual of Pasch's axiom ⋮ Two characterizations of the grid graphs ⋮ Second neighbourhoods of strongly regular graphs ⋮ On the \(p\)-rank of the adjacency matrices of strongly regular graphs ⋮ Structure and uniqueness of the \((81,20,1,6)\) strongly regular graph ⋮ Subplane covered nets and semipartial geometries ⋮ Is Taylor's graph geometric? ⋮ Designs as maximum codes in polynomial metric spaces ⋮ Skew-symmetric association schemes with two classes and strongly regular graphs of type \(L_{2n-1}(4n-1)\) ⋮ On the non-existence of \(\mathrm{srg}(76,21,2,7)\) ⋮ Combinatorial designs with two singular values. II: Partial geometric designs ⋮ Fissioned triangular schemes via the cross-ratio ⋮ Unnamed Item ⋮ The non-existence of certain skew-symmetric amorphous association schemes ⋮ Strongly regular \((\alpha,\beta)\)-geometries ⋮ On strongly regular graphs with \(\mu \leq 2\) ⋮ Descriptive complexity of graph spectra ⋮ New strongly regular graphs from finite geometries via switching ⋮ A four-class association scheme ⋮ Association schemes from the action of \(\text{PGL}(2,q)\) fixing a nonsingular conic in \(\text{PG}(2,q)\) ⋮ On the existence of equiangular tight frames ⋮ There is no (75,32,10,16) strongly regular graph ⋮ On the integrability of strongly regular graphs ⋮ A nonregular analogue of conference graphs ⋮ Unnamed Item ⋮ Regular weights of full rank on strongly regular graphs ⋮ Classifying strongly regular graphs using lexical ordering of adjacency matrices ⋮ Nonregular graphs with three eigenvalues ⋮ A (49,16,3,6) strongly regular graph does not exist ⋮ On a conjecture of Brouwer involving the connectivity of strongly regular graphs ⋮ Binary codes from graphs on triples ⋮ Unnamed Item ⋮ On the 486-vertex distance-regular graphs of Koolen-Riebeek and Soicher ⋮ Three-class association schemes ⋮ Optimality of partial geometric designs ⋮ Strongly regular decompositions of the complete graph ⋮ Partial geometric designs having circulant concurrence matrices
This page was built for publication:
