Hadamard graphs. I (Q1072573): Difference between revisions

The Hadamard graph of size \(n\) has \(2^n\) vertices. The vertex set is the set of all \((-1,+1)\)-vectors of size \(n\), and the edge set is the set of orthogonal pairs of such vectors. The main result of this paper is the determination of the spectrum of the adjacency matrix of a Hadamard graph. Also considered are other properties, such as the clique number and chromatic number, but these are not determined precisely.