Decompositions of complete multigraphs related to Hadamard matrices (Q1268621): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: David A. Gregory / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Gregory Gutin / rank | |||
Normal rank | |||
Revision as of 02:09, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decompositions of complete multigraphs related to Hadamard matrices |
scientific article |
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
