On an Application of Bipartite Graphs

Details On an Application of Bipartite Graphs On an Application of Bipartite Graphs

2012-02-02

arxiv.org/abs/1202.0401v1

Mathematics

Combinatorics

19 pages, 13 figures

Scientific paper

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 \times n^2$ case are discussed in this paper. This is done in conjunction with the popular Sudoku puzzle. Demonstrating the referred assertions, the cardinality of the sets of mutually disjoint S-permutation matrices in both the $4 \times 4$ and $9 \times 9$ cases are calculated. 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 shown.

Affiliated with

Also associated with

No associations

Rating

On an Application of Bipartite Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On an Application of Bipartite Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On an Application of Bipartite Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-187375