Bipartite graphs related to mutually disjoint \(S\)-permutation matrices

DOI10.5402/2012/384068zbMath1258.05016arXiv1202.0401OpenAlexW3104974379WikidataQ58690640 ScholiaQ58690640MaRDI QIDQ1935979

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

zbMATH Keywords

permutation matricesdisjoint pairsbipartite grtaphs

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (3)

On the number of disjoint pairs of S-permutation matrices ⋮ On the probability of two randomly generated \(S\)-permutation matrices to be disjoint ⋮ Calculation of the number of all pairs of disjoint S-permutation matrices

Cites Work

• Fractions of permutations. An application to Sudoku
• Permutation matrices related to Sudoku
• On the number of disjoint pairs of S-permutation matrices
• Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes

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