Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:1151871
Jump to:navigation, search

DOI10.1016/S0195-6698(80)80028-XzbMath0458.94047MaRDI QIDQ1151871

Etsuko Bannai, Eiichi 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)


Related Items (10)

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



Cites Work

  • A new 5‐arc‐transitive cubic graph
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1151871&oldid=13206545"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 05:17.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki