Abstract
Every Hadamard matrix of order induces a graph with vertices, called the Hadamard graph of . Since is a distance-regular graph with diameter , it induces a -class association scheme of order . In this article we deal with fission schemes of 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.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.