Bipartite Graphs Related to Mutually Disjoint S-Permutation Matrices

الملخص EN

Some numerical characteristics of bipartite graphs in relation to the problem of finding all disjoint pairs of S-permutation matrices in the general n2×n2 case are discussed in this paper.

All bipartite graphs of the type g=〈Rg∪Cg,Eg〉, where |Rg|=|Cg|=2 or |Rg|=|Cg|=3, are provided.

The cardinality of the sets of mutually disjoint S-permutation matrices in both the 4×4 and 9×9 cases is calculated.