Thread: 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 ?

Thank you in advance

The quastion is about to find how many subgrapgs of K8 are isomorphic to K3,3 if the vertices are distinguished

Originally Posted by nick1978

The quastion is about to find how many subgraphs of K8 are isomorphic to K3,3 if the vertices are distinguished

Well I would have never gotten that meaning from the OP.
There are 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 .

I hope that is in fact what the OP means.