Balanced sets and Q-polynomial association schemes
From MaRDI portal
Publication:1102296
DOI10.1007/BF01864156zbMATH Open0644.05016OpenAlexW2083787719MaRDI QIDQ1102296FDOQ1102296
Authors: Paul Terwilliger 
Publication date: 1988
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01864156
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spherical codes and designs
- Tight spherical designs. I
- Tight Spherical Disigns, II
- Binary polyhedral groups and Euclidean diagrams
- Characerization of a class of distance regular graphs.
- Characterization of H(n,q) by the parameters
- Root systems and the Johnson and Hamming graphs
Cited In (14)
- Character products and \(Q\)-polynomial group association schemes
- 2-homogeneous bipartite distance-regular graphs
- The Terwilliger algebra of a 2-homogeneous bipartite distance-regular graph
- Title not available (Why is that?)
- TD-pairs and the \(q\)-Onsager algebra
- An inequality on the cosines of a tight distance-regular graph
- A Higman inequality for regular near polygons
- Leaves in representation diagrams of bipartite distance-regular graphs
- A survey on spherical designs and algebraic combinatorics on spheres
- On the connectivity of graphs in association schemes
- Tight distance-regular graphs
- The last subconstituent of the Hemmeter graph
- Association schemes with multiple Q-polynomial structures
- Remarks on pseudo-vertex-transitive graphs with small diameter
This page was built for publication: Balanced sets and Q-polynomial association schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102296)
