Bipartite graphs related to mutually disjoint S-permutation matrices
DOI10.5402/2012/384068zbMATH Open1258.05016arXiv1202.0401OpenAlexW3104974379WikidataQ58690640 ScholiaQ58690640MaRDI QIDQ1935979FDOQ1935979
Authors: Krasimir Yordzhev
Publication date: 21 February 2013
Published in: ISRN Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.0401
Recommendations
- Calculation of the number of all pairs of disjoint S-permutation matrices
- On the number of mutually disjoint pairs of \(S\)-permutation matrices
- On the number of disjoint pairs of S-permutation matrices
- On the probability of two randomly generated \(S\)-permutation matrices to be disjoint
- scientific article; zbMATH DE number 1896992
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Exact enumeration problems, generating functions (05A15) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)
Cites Work
Cited In (6)
- Title not available (Why is that?)
- On the number of disjoint pairs of S-permutation matrices
- On the probability of two randomly generated \(S\)-permutation matrices to be disjoint
- On the number of mutually disjoint pairs of \(S\)-permutation matrices
- Title not available (Why is that?)
- Calculation of the number of all pairs of disjoint S-permutation matrices
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)