Isomorphism classes of association schemes induced by Hadamard matrices

preprint2015arXivOpen access

Abstract

Every Hadamard matrix HH of order n>1n > 1 induces a graph with 4n4n vertices, called the Hadamard graph Γ(H)Γ(H) of HH. Since Γ(H)Γ(H) is a distance-regular graph with diameter 44, it induces a 44-class association scheme (Ω,S)(Ω, S) of order 4n4n. In this article we deal with fission schemes of (Ω,S)(Ω, S) under certain conditions, and for such a fission scheme we estimate the number of isomorphism classes with the same intersection numbers as the fission scheme.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.