Decompositions of complete multigraphs related to Hadamard matrices (Q1268621)
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: Decompositions of complete multigraphs related to Hadamard matrices |
scientific article; zbMATH DE number 1212925
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decompositions of complete multigraphs related to Hadamard matrices |
scientific article; zbMATH DE number 1212925 |
Statements
Decompositions of complete multigraphs related to Hadamard matrices (English)
0 references
18 March 1999
0 references
Let \(\mu K_v\) be the complete multigraph with \(\mu\) edges between each pair of distinct vertices. This paper considers the case of \(v\leq 2\mu\). It is shown that if certain Hadamard and conference matrices exist, then the number of complete bipartite subgraphs needed to decompose the edge set of \(\mu K_v\) is equal to one of two well-defined numbers.
0 references
decompositions
0 references
Hadamard matrices
0 references
complete multigraph
0 references
conference matrices
0 references
complete bipartite subgraphs
0 references
0 references
