Bipartite graphs related to mutually disjoint S-permutation matrices

From MaRDI portal
Publication:1935979

DOI10.5402/2012/384068zbMATH Open1258.05016arXiv1202.0401OpenAlexW3104974379WikidataQ58690640 ScholiaQ58690640MaRDI QIDQ1935979FDOQ1935979


Authors: Krasimir Yordzhev Edit this on Wikidata


Publication date: 21 February 2013

Published in: ISRN Discrete Mathematics (Search for Journal in Brave)

Abstract: Some numerical characteristics of bipartite graphs in relation to the problem of finding all disjoint pairs of S-permutation matrices in the general n2imesn2 case are discussed in this paper. All bipartite graphs of the type g=<RgcupCg,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 4imes4 and 9imes9 cases are calculated.


Full work available at URL: https://arxiv.org/abs/1202.0401




Recommendations




Cites Work


Cited In (6)





This page was built for publication: Bipartite graphs related to mutually disjoint \(S\)-permutation matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1935979)