1 research outputs found
Canonical binary matrices related to bipartite graphs
The current paper is dedicated to the problem of finding the number of
mutually non isomorphic bipartite graphs of the type at given and , where and are the two
disjoint parts of the vertices of the graphs , and is the set of
edges, . For this purpose, the concept of
canonical binary matrix is introduced. The different canonical matrices
unambiguously describe the different with exactness up to isomorphism bipartite
graphs. We have found a necessary and sufficient condition an arbitrary matrix
to be canonical. This condition could be the base for realizing recursive
algorithm for finding all canonical binary matrices and
consequently for finding all with exactness up to isomorphism binary matrices
with cardinality of each part equal to and