Decompositions of complete multigraphs related to Hadamard matrices (Q1268621)

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.