Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes

zbMath1159.05053MaRDI QIDQ1010738

J. Degraer, Kris Coolsaet

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/129776

zbMATH Keywords

strongly regular graphsFano planeminimal idempotentsalgebraic constraintsdistance regular graphsantipodal distance regular graphsnumerical inaccuracyassocation schemescomputer classification resultsdistance regular cover

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (1)

Strongly regular graphs with non-trivial automorphisms

This page was built for publication: Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes