scientific article; zbMATH DE number 1303524
The solution of the graph equation \((n- 1)K_{2n}= (2n- 1)G(2n, 2n-1)\) is shown to be related to a concept of matchability of Hadamard matrices of order \(4m\). Consider a Hadamard matrix of order \(4m\) in standard form and delete the first column to get a \(4m\times (4m-1)\) matrix \(A= (a_{ij})\). The matrix \(A\) is matchable if given a pair of rows \(i\) and \(i'\) \((i< i')\), there is a unique \(j\) mapping \(i\) on \(i'\) such that \(a_{ij}a_{i'j}= -1\). It is shown that several standard constructions of Hadamard matrices yield matchable matrices. Many interesting problems for future research are also indicated. For the entire collection see [Zbl 0910.00036].
- Graph switching, 2-ranks, and graphical Hadamard matrices
- scientific article; zbMATH DE number 4014773 (Why is no real title available?)
- scientific article; zbMATH DE number 6497232 (Why is no real title available?)
- scientific article; zbMATH DE number 3853110 (Why is no real title available?)
- scientific article; zbMATH DE number 5073492 (Why is no real title available?)
- Designs, adjacency multigraphs and embeddings: A survey
- scientific article; zbMATH DE number 107837 (Why is no real title available?)
- scientific article; zbMATH DE number 1154597 (Why is no real title available?)
- Hadamard matrices and 1-factorizations of complete graphs
- Nonnegativity for hafnians of certain matrices
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250146)
