Publication:3992965
From MaRDI portal
zbMath0747.05073MaRDI QIDQ3992965
Arjeh M. Cohen, Arnold Neumaier, Andries E. Brouwer
Publication date: 17 September 1992
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
05C75: Structural characterization of families of graphs
Related Items
A linear construction for certain Kerdock and Preparata codes, Potential Theory on Distance-Regular Graphs, Vertex primitive graphs of order containing a large prime factor*, A new series of dense graphs of high girth, The lattice of integral flows and the lattice of integral cuts on a finite graph, On spin models, modular invariance, and duality, Distance-regular graphs with strongly regular subconstituents, Rational functions and association scheme parameters, A characterization of distance-regular graphs with diameter three, Partitions of sets of designs on seven, eight and nine points, From local adjacency polynomials to locally pseudo-distance-regular graphs, Simple connectedness of the 3-local geometry of the Monster, A reconstruction problem related to balance equations, The vulnerability of the diameter of folded \(n\)-cubes, On coupling constructions and rates in the CLT for dependent summands with applications to the antivoter model and weighted \(U\)-statistics, Boundary graphs. II: The limit case of a spectral property, Graphs with constant \(\mu\) and \(\overline{\mu}\), Landscapes and their correlation functions, Imprimitive Q-polynomial association schemes, Association schemes with multiple Q-polynomial structures, On distance-regular graphs with height two. II, A note on thin \(P\)-polynomial and dual-thin \(Q\)-polynomial symmetric association schemes, The structure of nonthin irreducible \(T\)-modules of endpoint 1: Ladder bases and classical parameters, On locally projective graphs of girth 5, Bounds on special subsets in graphs, eigenvalues and association schemes, Distance-regular graphs of valency 6 and \(a_1=1\), On four-weight spin models and their gauge transformations, On near-polygons and the Coxeter cap in PG(5,3), Mixed partitions of PG(3,\(q\)), Maximal orthogonality and pseudo-orthogonality with applications to generalized inverses, The number of nets of the regular convex polytopes in dimension \(\leq 4\), 2-homogeneous bipartite distance-regular graphs, Small regular graphs with four eigenvalues, On the common nature of spreads and pencils in \(\text{PG}(d,q)\), A census of infinite distance-transitive graphs, On designs in compact metric spaces and a universal bound on their size, On the dual distance and the gap of a binary code, Integral standard table algebras with a faithful nonreal element of degree 3, On spin models, triply regular association schemes, and duality, On upper bounds for code distance and covering radius of designs in polynomial metric spaces, Expanding and forwarding, Fissions of classical self-dual association schemes, Robust phase transitions for Heisenberg and other models on general trees, Krein conditions and near polygons, Distance-transitive graphs of type \(q.K_{q,q}\) and projective planes, Completely transitive codes in Hamming graphs, Characterization of the group association scheme of PSL(2, 7), L-polytopes and equiangular lines, Application of cut polyhedra. I, The complete list of maximal cliques of Quad\((n,q)\), \(q\) odd, On geometries of the Fischer groups, On strongly closed subgraphs of highly regular graphs, Anticodes for the Grassmann and bilinear forms graphs, Explicit construction of graphs with an arbitrary large girth and of large size, A remark on bipartite distance-regular graphs of even valency, Kite-free \(P\)- and \(Q\)-polynomial schemes, Distance-regular graphs with \(\Gamma(x) \simeq 3* K_{a+1}\), A family of antipodal distance-regular graphs related to the classical Preparata codes, Generalized quadrangles with a regular point and association schemes, Regular graphs with four eigenvalues, Rank 5 association schemes and triality, Toughness and spectrum of a graph, On the multiplicity of eigenvalues of distance-regular graphs, Krein conditions for coherent configurations, On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\), Interlacing eigenvalues and graphs, Chromatic invariants for finite graphs: Theme and polynomial variations, Extended generalized octagons and the group \(He\), Random walks and orthogonal functions associated with highly symmetric graphs, Twice Q-polynomial distance-regular graphs are thin, Distance-regular subgraphs in a distance-regular graph. I, Distance-regular subgraphs in a distance-regular graph. II, A characterization of Grassmann graphs, Extending polar spaces of rank at least 3, Lattices and association schemes: a unimodular example in dimension 28, Commutative association schemes whose symmetrizations have two classes, On distance-regular graphs with height two, On distance-regular graphs with \(k_ i= k_ j\). II, Partitions of sets of two-fold triple systems, and their relations to some strongly regular graphs, A constant bound on the number of columns \((1,k-2,1)\) in the intersection array of a distance-regular graph, Distance-regularity and the spectrum of graphs, Bus interconnection networks, Quasi semisymmetric designs with extremal conditions, Symmetric versus non-symmetric spin models for link invariants, Generalized table algebras, The local structure of a bipartite distance-regular graph, Strongly closed subgraphs in a regular thick near polygon, An algorithmic approach to fundamental groups and covers of combinatorial cell complexes, Shortest paths in distance-regular graphs, Affine distance-transitive groups of dimension one, Distance regularity in direct-product graphs, Character products and \(Q\)-polynomial group association schemes, Primitive commutative association schemes with a non-symmetric relation of valency 3, A remark on a theorem of P. de la Harpe and V. F. R. Jones, On distance regular graphs with \(c_ i=b_ 1\), Degree of indecomposability of certain highly regular zero-one matrices, Unnamed Item, Exceptional graphs with smallest eigenvalue -2 and related problems, Spectra of semi-regular polytopes, Weight distributions of geometric Goppa codes, A construction of the simple group of Rudvalis from the group U3(5):2, 𝑞-Krawtchouk polynomials as spherical functions on the Hecke algebra of type 𝐵, Geometric representations of graphs, Geometric representations of graphs, Distance-transitive representations of the sporadic groups, Graphs cospectral with distance-regular graphs, Covering by complements of subspaces, The Primitive Distance-Transitive Representations of the Fischer Groups, The Noncommutativity of Hecke Algebras Associated to Weyl Groups, Affine distance-transitive graphs with quadratic forms, Spin models constructed from Hadamard matrices, An algebra associated with a spin model, The girth of a thin distance-regular graph, Spreads in strongly regular graphs, Compact graphs and equitable partitions, The irreducible modules of the Terwilliger algebras of Doob schemes, On the \(p\)-rank of the adjacency matrices of strongly regular graphs, On subgraphs in distance-regular graphs, The subconstituent algebra of an association scheme. I, On complete regularity of extended codes, Laplace eigenvalues of graphs---a survey, The performance of an eigenvalue bound on the max-cut problem in some classes of graphs, A distance-regular graph with intersection array (5,4,3,3; 1,1,1,2) does not exist, A new infinite series of regular uniformly geodetic code graphs, Askey-Wilson polynomials, kernel polynomials and association schemes, The even and odd cut polytopes, On graphs with multiple eigenvalues, Feasibility conditions for non-symmetric 3-class association schemes, Partitions in matrices and graphs, Splitting fields of association schemes, On pseudo-automorphisms and fusions of an association scheme, The \((\Delta{} , d, d', \Delta{} - 1)\)-problem with applications to computer networks, Bounding the diameter of a distance regular graph by a function of \(k_ d\), Improvement of Bruck's completion theorem, A remark on the intersection arrays of distance regular graphs and the distance regular graphs of diameter \(d=3i -1\) with \(b_ i =1\) and \(k>2\), A new condition for distance-regular graphs, A new family of distance-regular graphs and the \(\{ 0,1,2 \}\)-cliques in dual polar graphs, Two-graphs and doubly transitive groups, Almost rank three graphs, Locally \(K_{3,3}\) or Petersen graphs, Structure and uniqueness of the \((81,20,1,6)\) strongly regular graph, Extension operations for cuts, Local indecomposability of certain geometric graphs, Completely regular codes, Facets for the cut cone. I, Designs as maximum codes in polynomial metric spaces, Affine distance-transitive groups with alternating or symmetric point stabiliser, Linear spaces with \(n^ 2 + n + 2\) lines, On distance transitive graphs whose automorphism groups are affine, Duality maps of finite abelian groups and their applications to spin models, Distance-regular graphs with \(c_i=b_{d-i}\) and antipodal double covers, A new distance-regular graph associated to the Mathieu group \(M_{10}\), The spectra of Coxeter graphs, Bose-Mesner algebras related to type II matrices and spin models, On symmetric association schemes with \(k_1=3\), The algebra of flows in graphs, The impact of 2-neighborhoods on graph structure, On a class of graphs without 3-stars, A group-theoretic framework for the construction of packings in Grassmannian spaces, Chip-firing and the critical group of a graph, The action of \(F_4(q)\) on cosets of \(B_4(q)\), A characterization of triangular and lattice graphs, Locally Shrikhande graphs and their automorphisms, Distance-regular graphs which support a spin model are thin, Compact cellular algebras and permutation groups, Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications, Symmetric flows and broadcasting in hypercubes, Metric coset schemes revisited, The distance-regular graphs of valency four, Tight graphs and their primitive idempotents, Three-class association schemes, The Terwilliger algebras of bipartite \(P\)- and \(Q\)-polynomial schemes, Erdős-Ko-Rado-type results over \(J_q(n,d),H_q(n,d)\) and their designs, A reconstruction problem related to balance equations. II: The general case, Association schemes of small order, Eigenvalue interlacing and weight parameters of graphs, An improvement of the Ivanov bound, On the spectrum, the growth, and the diameter of a graph, Some formulas for spin models on distance-regular graphs, Bipartite \(Q\)-polynomial quotients of antipodal distance-regular graphs, On primitive commutative association schemes with a nonsymmetric relation of valency 4, Cyclotomic schemes over finite, commutative, admissible rings, Cyclotomic schemes over finite rings, Association schemes and fusion algebras. (An introduction), Some extensions and embeddings of near polygons, The automorphism group and the convex subgraphs of the quadratic forms graph in characteristic 2, Non-Cayley vertex-transitive graphs of order twice the product of two odd primes, On uniformly geodetic graphs, A computer-free proof of a theorem of Weiss and Yoshiara, \(\ell_ 1\)-rigid graphs, Completely regular designs of strength one, Two families of strongly regular graphs with the 4-vertex condition, An application of intersection diagrams of high rank, On distance-biregular graphs of girth divisible by four, Classification of certain types of tilde geometries, Geometric characterization of the sporadic groups \(Fi_{22}\), \(Fi_{23}\), and \(Fi_{24}\), Regular codes in regular graphs are difficult, Finite distance-transitive generalized polygons, Distance-transitive antipodal covers: The extremal case, On splitting the Clebsch graph, An easy linear algebra approach to the eigenvalues of the Bernoulli- Laplace model of diffusion, Quotients of association schemes, A characterization of two classes of strongly regular graphs, Class 3 association schemes whose symmetrizations have two classes, Automorphism groups of BWD-codes, Determination of the distance-regular graphs without 3-claws, Intersection numbers of bipartite distance-regular graphs, Eigenvalues, eigenspaces and distances to subsets, The vertex connectivity of a \(\{ 0,2\}\)-graph equals its degree, On regular Terwilliger graphs with \(\mu=2\), On the geometric graph isomorphism problem
