A construction of non-isomorphic "small" bipartite graphs


Dragan M. Acketa, Zoran Budimac, Ratko Tošić




All the non-isomorphic bipartite graphs with at most 11 vertices are constructed by using two independent algorithms based on two different representations of these graphs.