# Math Help - Graph theory

1. ## Graph theory

I would like to help me with this homework:

Let be the adjacency matrix of and the adjacency matrix of . Asume that every vertex of is distinguished.
How many sub-matrices of ,if we apply some reorder so much to their(submatrices) rows as to their columns, are equal to ?

There are $280$ ways to divide a group of eight individuals into two groups of three and one group of two. The two groups of three could be used as the bipartite sets in $\math{K}_{3,3}$.