Calculation of the number of all pairs of disjoint S-permutation matrices

From MaRDI portal
Publication:670673

DOI10.1016/J.AMC.2015.06.054zbMATH Open1410.05016arXiv1501.03395OpenAlexW2963380668MaRDI QIDQ670673FDOQ670673

Krasimir Yordzhev

Publication date: 18 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Abstract: The concept of S-permutation matrix is considered. A general formula for counting all disjoint pairs of n2imesn2 S-permutation matrices as a function of the positive integer n is formulated and proven in this paper. To do that, the graph theory techniques have been used. It has been shown that to count the number of disjoint pairs of n2imesn2 S-permutation matrices, it is sufficient to obtain some numerical characteristics of all nimesn bipartite graphs.


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




Recommendations




Cites Work


Cited In (4)





This page was built for publication: Calculation of the number of all pairs of disjoint S-permutation matrices

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