Decompositions of complete multigraphs related to Hadamard matrices

DOI10.1006/jcta.1997.2853zbMath0908.05071OpenAlexW1969651281MaRDI QIDQ1268621

Kevin N. Vander Meulen, David A. Gregory

Publication date: 18 March 1999

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ed78f8cebbee79a8815caacc19215d9b9e8aed4f

zbMATH Keywords

Hadamard matricesdecompositionscomplete multigraphcomplete bipartite subgraphsconference matrices

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Decompositions of complete multigraphs derived from Hadamard matrices, Inertia and biclique decompositions of joins of graphs

Cites Work

• Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs
• On the decomposition ofkn into complete bipartite graphs
• The biparticity of a graph
• On the Addressing Problem for Loop Switching
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item