How many P-polynomial structures can an association scheme have?

DOI10.1016/S0195-6698(80)80028-XzbMATH Open0458.94047MaRDI QIDQ1151871FDOQ1151871

Authors: Eiichi Bannai, Etsuko Bannai 

Publication date: 1980

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

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A new 5‐arc‐transitive cubic graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• Nonexistence of exceptional 5-class association schemes with two \(Q\)-polynomial structures
• Distance-transitive representations of the symmetric groups
• A proof of a dodecahedron conjecture for distance sets
• Association schemes and quadratic transformations for orthogonal polynomials
• Affine distance-transitive groups of dimension one
• Metrically homogeneous graphs of diameter \(3\)
• A remark on association schemes with two P-polynomial structures
• On strongly closed subgraphs of highly regular graphs
• Almost rank three graphs
• Association schemes with multiple Q-polynomial structures

This page was built for publication: How many P-polynomial structures can an association scheme have?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1151871)