Decompositions of complete multigraphs derived from Hadamard matrices

DOI10.1016/S0097-3165(03)00053-0zbMath1020.05054MaRDI QIDQ1399905

Katrina J. Geertsema, Kevin N. Vander Meulen

Publication date: 30 July 2003

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

zbMATH Keywords

biclique

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decompositions of complete multigraphs related to Hadamard matrices
• How Does a Complete Graph Split into Bipartite Graphs and How are Neighborly Cubes Arranged?
• Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs
• On the Addressing Problem for Loop Switching

This page was built for publication: Decompositions of complete multigraphs derived from Hadamard matrices