scientific article
From MaRDI portal
Publication:4000288
zbMath0743.05004MaRDI QIDQ4000288
Peter J. Cameron, J. H. van Lint
Publication date: 18 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of block designs (05B05) Association schemes, strongly regular graphs (05E30) Applications of design theory to circuits and networks (94C30)
Related Items (only showing first 100 items - show all)
Generalized wreath products of association schemes ⋮ Tamaschke's results on Schur rings and a generalization of association schemes ⋮ Construction of the outer automorphism of \(\mathcal {S}_{6}\) via a complex Hadamard matrix ⋮ A survey of partial difference sets ⋮ Generalized quadrangles of order \((s,s^ 2)\). I ⋮ Strongly regular Cayley graphs with \(\lambda-\mu=-1\) ⋮ Guessing games on triangle-free graphs ⋮ Computing the metric dimension of wheel related graphs ⋮ The lines of \(PG(4, 2)\) are the points on a quintic in \(PG(9, 2)\) ⋮ Characterization and classification of optimal LCD codes ⋮ A note on Assmus-Mattson type theorems ⋮ Quotients of Coxeter complexes, fundamental groupoids and regular graphs ⋮ Quasi-symmetric designs related to the triangular graph ⋮ Quasi-residual designs, \(1{1\over 2}\)-designs, and strongly regular multigraphs ⋮ Quasi-symmetric designs and codes meeting the Grey-Rankin bound ⋮ Graph domination, tabu search and the football pool problem ⋮ Constructions and bounds for mixed-dimension subspace codes ⋮ \(LCD\) codes from adjacency matrices of graphs ⋮ 5-chromatic strongly regular graphs ⋮ Extendable Steiner designs from finite geometries ⋮ Modular representation theory of BIB designs ⋮ Co-cliques and star complements in extremal strongly regular graphs ⋮ Nordstrom-Robinson code and \(A_7\)-geometry ⋮ On the number of blocks in a generalized Steiner system ⋮ On strongly regular bicirculants ⋮ A construction of finite Frobenius rings and its application to partial difference sets ⋮ Strongly regular graph with parameters \((486, 112, 36, 66)\) does not exist ⋮ On graphs with multiple eigenvalues ⋮ Landscapes and their correlation functions ⋮ The local density of triangle-free graphs ⋮ On the extendability of code isometries ⋮ On graphs with an eigenvalue of maximal multiplicity ⋮ A note on binary completely regular codes with large minimum distance ⋮ Strongly regular graphs with non-trivial automorphisms ⋮ A new upper bound on the parameters of quasi-symmetric designs ⋮ The extendability of matchings in strongly regular graphs ⋮ Switched graphs of some strongly regular graphs related to the symplectic graph ⋮ Non-derivable strongly regular graphs from quasi-symmetric designs ⋮ The maximal exceptional graphs ⋮ A study of \((xv_t, xv_{t-1})\)-minihypers in \(\mathrm{PG}(t,q)\) ⋮ On the metric dimension of circulant graphs ⋮ The distance signatures of the incidence graphs of affine resolvable designs ⋮ Eigenvalue multiplicity in triangle-free graphs ⋮ On automorphisms of strongly regular graphs with parameters (640, 243, 66, 108) ⋮ On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency ⋮ On graphs in which the Hoffman bound for cocliques equals the Cvetcovich bound ⋮ Pseudogeometric graph for \(pG_{4} (8, 175)\) ⋮ On cliques in isoregular graphs ⋮ On strongly regular graphs with eigenvalue \(\mu\) and their extensions ⋮ Regular star complements in strongly regular graphs ⋮ Binary representations of regular graphs ⋮ On some combinatorial structures constructed from the groups \(L(3, 5), U(5, 2)\), and \(S(6, 2)\) ⋮ Graphs with least eigenvalue \(-2\): ten years on ⋮ A survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemes ⋮ On automorphisms of a generalized hexagon of order \((t,t)\) ⋮ Computing metric dimension of compressed zero divisor graphs associated to rings ⋮ Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs ⋮ On the automorphisms of designs constructed from finite simple groups ⋮ Spreads in strongly regular graphs ⋮ On extensions of some block designs ⋮ Clique partitions of complements of forests and bounded degree graphs ⋮ Edge-regular graphs with regular cliques ⋮ On a vertex-minimal triangulation of \(\mathbb R \mathrm P^4\) ⋮ Kerdock codes and related planes ⋮ Ball packings with high chromatic numbers from strongly regular graphs ⋮ The de Bruijn-Erdős theorem for hypergraphs ⋮ Star complements in regular graphs: old and new results ⋮ Strongly regular semi-Cayley graphs ⋮ On automorphisms of distance-regular graph with intersection array \(\{15, 12, 1; 1, 2, 15\}\) ⋮ Minimal Euclidean representations of graphs ⋮ Automorphisms of coverings of the strongly regular graph with parameters \((81, 20, 1, 6)\) ⋮ Graphs with least eigenvalue \(-2\): a new proof of the 31 forbidden subgraphs theorem ⋮ On quasi-3 designs and spin models ⋮ Balanced colourings of strongly regular graphs ⋮ On the existence of equiangular tight frames ⋮ Vertex-primitive digraphs having vertices with almost equal neighbourhoods ⋮ On automorphisms of 6-covers of the Higman-Sims graph ⋮ Automorphisms of coverings of strongly regular graphs with parameters (81,20,1,6) ⋮ Random constructions and density results ⋮ Ring geometries, two-weight codes, and strongly regular graphs ⋮ On Boolean functions with the sum of every two of them being bent ⋮ Polyhedrons and PBIBDs from hyperbolic manifolds ⋮ Characterization of certain minimal rank designs ⋮ Regular weights of full rank on strongly regular graphs ⋮ Nonregular graphs with three eigenvalues ⋮ Flag-transitive symmetric 2-(96,20,4)-designs ⋮ A distance-regular graph with the intersection array \(\{8, 7, 5; 1, 1, 4\}\) and its automorphisms ⋮ A criterion for the \(t\)-vertex condition of graphs ⋮ A survey on spherical designs and algebraic combinatorics on spheres ⋮ Commutative association schemes ⋮ Graphical \(t\)-designs via polynomial Kramer-Mesner matrices ⋮ Two classes of \(q\)-ary codes based on group divisible association schemes ⋮ On the coverings of the Higman-Sims graph and their automorphisms ⋮ Some \(t\)-designs are minimal \((t+1)\)-coverings ⋮ Tight distance-regular graphs ⋮ Star complements and switching in graphs ⋮ Graphs with least eigenvalue \(-2\); a historical survey and recent developments in maximal exceptional graphs ⋮ Codes, graphs, and schemes from nonlinear functions ⋮ Mono-multi bipartite Ramsey numbers, designs, and matrices ⋮ A construction of non self-orthogonal designs
This page was built for publication:
