Sign patterns of matrices and their inverses (Q1087886)

For the class of \((\pm 1)\)-matrices a graph G is defined with as vertices the \((\pm 1)\)-matrices and an edge if two \((\pm 1)\)-matrices A and B are paired, meaning that there exist matrices \(A_ 1\) and \(B_ 1\) such that sgn \(A_ 1=A\) and sgn \(B_ 1=B\) (i.e. the sign pattern of \(A_ 1\), \(B_ 1\) is A resp. B). The degree, connectivity, radius and diameter of G are studied. Moreover, a complete description is given for the \(3\times 3\) case. The following concept is used: A subset \(E\subset <n>^ 2\) \((<n>=\{1,2,...,n\})\) is of König type p iff it does not contain any product set of circumference 2p, i.e. \(C_ 1\times C_ 2\subset E\) implies \(| C_ 1| +| C_ 2| <p\).