Bipartite Graphs Related to Mutually Disjoint S-Permutation Matrices. (9th December 2012)

• Record Type: Journal Article
• Authors: Yordzhev, Krasimir
• Other Names: Kelarev A. Academic Editor.; Klostermeyer W. F. Academic Editor.; Prellberg T. Academic Editor.; Wallis W. Academic Editor.
• Is Part Of: ISRN discrete mathematics. Volume 2012(2012)
• Publication Date: 2012-12-09
• Subjects: Discrete mathematics -- Periodicals; Computer science -- Mathematics; Computer science -- Mathematics; Periodicals; 511.1
• DOI: 10.5402/2012/384068
• Languages: English
• ISSNs: 2090-7788

Abstract

Abstract : Some numerical characteristics of bipartite graphs in relation to the problem of finding all disjoint pairs of S-permutation matrices in the general n 2 × n 2 case are discussed in this paper. All bipartite graphs of the type g = 〈 R g ∪ C g, E g 〉, where | R g | = | C g | = 2 or | R g | = | C g | = 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.