On splitting the Clebsch graph

DOI10.1016/0019-3577(94)90004-3zbMath0814.05072OpenAlexW2004892900MaRDI QIDQ1344159

H. L. Claasen, R. W. Goldbach

Publication date: 9 February 1995

Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0019-3577(94)90004-3

zbMATH Keywords

association schemesstrongly regular graphClebsch graphsymmetric association scheme

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (2)

On non-symmetric commutative association schemes with exactly one pair of non-symmetric relations ⋮ Feasibility conditions for non-symmetric 3-class association schemes

Cites Work

• Feasibility conditions for non-symmetric 3-class association schemes
• Cyclotomic schemes over finite, commutative, admissible rings
• A primitive non-symmetric 3-class association scheme on 36 elements with \(p_{11}^ 1=0\) exists and is unique
• The structure of imprimitive non-symmetric 3-class association schemes
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On splitting the Clebsch graph