Three-class association schemes

DOI10.1023/A:1018628204156zbMath0929.05096MaRDI QIDQ1296390

van Dam, Edwin R.

Publication date: 2 August 1999

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

zbMATH Keywords

Bose-Mesner algebraassociation schemesdistance-regular graphseigenvaluesspectrumHoffman coloringslinked symmetric design

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Other designs, configurations (05B30)

Related Items (44)

A spectral characterization of the \(s\)-clique extension of the square grid graphs ⋮ Characterizing distance-regularity of graphs by the spectrum ⋮ 5-chromatic strongly regular graphs ⋮ Association schemes on 28 points as mergings of a half-homogeneous coherent configuration ⋮ Signed graphs with at most three eigenvalues ⋮ Classification of partially metric Q-polynomial association schemes with \(m_1=4\) ⋮ Three-class association schemes from partial geometric designs ⋮ Three-class association schemes on Galois rings in characteristic 4 ⋮ Bounds on special subsets in graphs, eigenvalues and association schemes ⋮ Three-class association schemes from cyclotomy ⋮ Imprimitive cometric association schemes: constructions and analysis ⋮ On association schemes generated by a relation or an idempotent ⋮ Schematic 4-designs ⋮ LCD subspace codes ⋮ A Family of Partial Geometric Designs from Three-Class Association Schemes ⋮ Quotient-polynomial graphs ⋮ Uniqueness of an association scheme related to the Witt design on 11 points ⋮ Four-class skew-symmetric association schemes ⋮ Linking systems in nonelementary abelian groups ⋮ On symmetric association schemes and associated quotient-polynomial graphs ⋮ Linked systems of symmetric designs ⋮ The local structure of a bipartite distance-regular graph ⋮ Uniqueness of certain association schemes ⋮ Characterizations of regularity for certain \(Q\)-polynomial association schemes ⋮ Complex Hadamard matrices contained in a Bose-Mesner algebra ⋮ Two characterizations of the grid graphs ⋮ Noncommutative reality-based algebras of rank 6 ⋮ A CLASS OF ASSOCIATION SCHEMES IN WHICH ALL BASIS RELATIONS HAVE VALENCY 1 OR λ > 2 ⋮ Linked systems of symmetric group divisible designs ⋮ On few-class Q-polynomial association schemes: feasible parameters and nonexistence results ⋮ Divisible design digraphs and association schemes ⋮ Some spectral and quasi-spectral characterizations of distance-regular graphs ⋮ Some implications on amorphic association schemes ⋮ Cyclotomy over products of finite fields and combinatorial applications ⋮ Mutually unbiased bush-type Hadamard matrices and association schemes ⋮ On Boolean functions with the sum of every two of them being bent ⋮ Fissions of classical self-dual association schemes ⋮ Linked systems of symmetric group divisible designs of type. II ⋮ Small regular graphs with four eigenvalues ⋮ Classification of three-class association schemes using backtracking with dynamic variable ordering ⋮ On quasi-strongly regular graphs ⋮ The 3-class association schemes connected with checkered Hadamard matrices of order 16 ⋮ Weighted association schemes, fusions, and minimal coherent closures ⋮ Disjoint weighing matrices

Cites Work

• Spreads in strongly regular graphs
• Reconstructing a generalized quadrangle from its distance two association scheme
• Pseudocyclic 3-class association schemes on 28 points
• On a pair of dual subschemes of the Hamming scheme \(H_ n(q)\)
• Coherent algebras
• 2-designs having an intersection number \(k-n\)
• Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields
• On designs related to coherent configurations of type \((^ 2\;^ 2_ 4)\)
• A complete classification of symmetric (31, 10, 3) designs
• Distance regular covers of the complete graph
• There exists no distance-regular graph with intersection array \((5,4,3;1,1,2)\)
• Quasi-symmetric designs related to the triangular graph
• Problems in algebraic combinatorics
• A characterization of distance-regular graphs with diameter three
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• Some applications of the proper and adjacency polynomials in the theory of graph spectra
• Antipodal covers of strongly regular graphs
• Small regular graphs with four eigenvalues
• A (49,16,3,6) strongly regular graph does not exist
• A family of antipodal distance-regular graphs related to the classical Preparata codes
• Regular graphs with four eigenvalues
• Rank 5 association schemes and triality
• Regular two-graphs on 36 vertices
• Interlacing eigenvalues and graphs
• Distance-regularity and the spectrum of graphs
• On groups with several doubly-transitive permutation representations
• On Linear Associative Algebras Corresponding to Association Schemes of Partially Balanced Designs
• A Necessary Condition for Existence of Regular and Symmetrical Experimental Designs of Triangular Type, with Partially Balanced Incomplete Blocks
• One-factorizations of the complete graph—A survey
• On the Polynomial of a Graph
• Enumeration of Symmetric Designs (25,9,3)
• There are 526,915,620 nonisomorphic one‐factorizations of K₁₂
• Graphs cospectral with distance-regular graphs
• Cubic Designs
• Combinatorial Properties of Group Divisible Incomplete Block Designs
• Classification and Analysis of Partially Balanced Incomplete Block Designs with Two Associate Classes
• On an Application of Kronecker Product of Matrices to Statistical Designs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Three-class association schemes