Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
131 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

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

Published 2 Feb 2012 in math.CO and cs.DM

Abstract: Some numerical characteristics of bipartite graphs in relation to the problem of finding all disjoint pairs of S-permutation matrices in the general $n2 \times n2$ case are discussed in this paper. All bipartite graphs of the type $g=<R_g \cup 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 \times 4$ and $9 \times 9$ cases are calculated.

Citations (7)

Summary

We haven't generated a summary for this paper yet.