Bipartite Graphs Related to Mutually Disjoint S-Permutation Matrices
Author
Source
Issue
Vol. 2012, Issue 2012 (31 Dec. 2012), pp.1-18, 18 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2012-12-09
Country of Publication
Egypt
No. of Pages
18
Main Subjects
Abstract EN
Some numerical characteristics of bipartite graphs in relation to the problem of finding all disjoint pairs of S-permutation matrices in the general n2×n2 case are discussed in this paper.
All bipartite graphs of the type g=〈Rg∪Cg,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 4×4 and 9×9 cases is calculated.
American Psychological Association (APA)
Yordzhev, Krasimir. 2012. Bipartite Graphs Related to Mutually Disjoint S-Permutation Matrices. ISRN Discrete Mathematics،Vol. 2012, no. 2012, pp.1-18.
https://search.emarefa.net/detail/BIM-467809
Modern Language Association (MLA)
Yordzhev, Krasimir. Bipartite Graphs Related to Mutually Disjoint S-Permutation Matrices. ISRN Discrete Mathematics No. 2012 (2012), pp.1-18.
https://search.emarefa.net/detail/BIM-467809
American Medical Association (AMA)
Yordzhev, Krasimir. Bipartite Graphs Related to Mutually Disjoint S-Permutation Matrices. ISRN Discrete Mathematics. 2012. Vol. 2012, no. 2012, pp.1-18.
https://search.emarefa.net/detail/BIM-467809
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-467809
