Upper bounds given by equitable partitions of a primitive association scheme

DOI10.1016/j.ejc.2005.05.003zbMath1106.05106OpenAlexW1985283385MaRDI QIDQ2493104

Mitsugu Hirasaka

Publication date: 9 June 2006

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

Full work available at URL: https://doi.org/10.1016/j.ejc.2005.05.003

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) General theory for finite permutation groups (20B05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterization of association schemes by equitable partitions
• On the order of uniprimitive permutation groups
• On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler
• Quotients of association schemes
• An algebraic approach to association schemes
• Generalized table algebras
• On primitive cellular algebras

This page was built for publication: Upper bounds given by equitable partitions of a primitive association scheme