A strongly regular decomposition of the complete graph and its association scheme

DOI10.1016/j.ffa.2017.08.012zbMath1372.05233arXiv1701.05630OpenAlexW2753771241MaRDI QIDQ2406695

Sho Suda, Hadi Kharaghani, Sara Sasani

Publication date: 5 October 2017

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.05630

zbMATH Keywords

symmetric designassociation schemestrongly regular graphgeneralized Hadamard matrixsymmetric Latin squarestrongly regular decomposition

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (4)

Non-commutative association schemes and their fusion association schemes ⋮ On strongly regular designs admitting fusion to strongly regular decomposition ⋮ Divisible design digraphs and association schemes ⋮ Commutative association schemes obtained from twin prime powers, Fermat primes, Mersenne primes

Cites Work

• Unnamed Item
• Unnamed Item
• Strongly regular decompositions of the complete graph
• Combinatorial Designs
• Construction of strongly regular graphs using affine designs

This page was built for publication: A strongly regular decomposition of the complete graph and its association scheme