Hadamard graphs. I (Q1072573)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Hadamard graphs. I |
scientific article; zbMATH DE number 3941586
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hadamard graphs. I |
scientific article; zbMATH DE number 3941586 |
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
