Decompositions of complete multigraphs related to Hadamard matrices (Q1268621): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: David A. Gregory / rank | |||
Property / reviewed by | |||
Property / reviewed by: Gregory Gutin / rank | |||
Property / author | |||
Property / author: David A. Gregory / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Gregory Gutin / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1969651281 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3136986 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4876961 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Addressing Problem for Loop Switching / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The biparticity of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4326212 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4374707 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4146667 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4152571 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the decomposition ofkn into complete bipartite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4002255 / rank | |||
Normal rank |
Latest revision as of 16:54, 28 May 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
0 references