%0 Journal Article
%T A Partial Order on Bipartite Graphs with n Vertices
%A Emil Daniel Schwab
%J Annals. Computer Science Series
%D 2009
%I Mirton Publishing House, Timisoara
%X The paper examines a partial order on bipartite graphs (X1, X2, E) with n vertices, X1¡ÈX2={1,2,¡­,n}. The basis of such bipartite graph is X1 = {1,2,¡­,k}, 0¡Ük¡Ün. If U = (X1, X2, E(U)) and V = (Y1,Y2, E(V)) then U¡ÜV iff |X1| ¡Ü |Y1| and {(i,j) E(U): j>|Y1|} = ={(i,j) E(V):i¡Ü|X1|}. This partial order is a natural partial order of subobjects of an object in a triangular category with bipartite graphs as morphisms.
%U http://anale-informatica.tibiscus.ro/download/lucrari/7-1-31-Schwab.pdf