For an undirected graph G without self-loop, we prove: (ⅰ) that the number of closed patterns in the adjacency matrix of G is even; (ⅱ) that the number of the closed patterns is precisely double the number of maximal complete bipartite subgraphs of G; (ⅲ) that for every maximal complete bipartite subgraph, there always exists a unique pair of closed patterns that matches the two vertex sets of the subgraph. Therefore, we can enumerate all maximal complete bipartite subgraphs by using efficient algorithms for mining closed patterns which have been extensively studied in the data mining field.
展开▼
