Hadamard graphs. I (Q1072573): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 03:05, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Hadamard graphs. I |
scientific article |
Statements
Hadamard graphs. I (English)
0 references
1985
0 references
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.
0 references
Hadamard matrix
0 references
graph spectrum
0 references
graph eigenvalue
0 references
Hadamard graph
0 references