Bipartite graphs related to mutually disjoint \(S\)-permutation matrices (Q1935979): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q273282 |
Changed an Item |
||
Property / author | |||
Property / author: Krasimir Yordzhev / rank | |||
Normal rank |
Revision as of 08:41, 12 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bipartite graphs related to mutually disjoint \(S\)-permutation matrices |
scientific article |
Statements
Bipartite graphs related to mutually disjoint \(S\)-permutation matrices (English)
0 references
21 February 2013
0 references
Summary: Some numerical characteristics of bipartite graphs in relation to the problem of finding all disjoint pairs of \(S\)-permutation matrices in the general \(n^2 \times n^2\) case are discussed in this paper. All bipartite graphs of the type \(g = \langle R_g \cup C_g, E_g \rangle\), where \(|R_g| = |C_g| = 2\) or \(|R_g| = |C_g| = 3\), are provided. The cardinality of the sets of mutually disjoint \(S\)-permutation matrices in both the \(4 \times 4\) and \(9 \times 9\) cases is calculated.
0 references
permutation matrices
0 references
disjoint pairs
0 references
bipartite grtaphs
0 references