A Partial Order on Bipartite Graphs with n Vertices

Details A Partial Order on Bipartite Graphs with n Vertices A Partial Order on Bipartite Graphs with n Vertices

2009-06-04

arxiv.org/abs/0906.0859v1

Ann. Univ. Tibiscus Comp. Sci. Series VII(2009),315-324

Computer Science

Discrete Mathematics

10 pages,exposed on 5th International Conference "Actualities and Perspectives on Hardware and Software" - APHS2009, Timisoara

Scientific paper

The paper examines a partial order on bipartite graphs (X1, X2, E) with n
vertices, X1UX2={1,2,...,n}. This partial order is a natural partial order of
subobjects of an object in a triangular category with bipartite graphs as
morphisms.

Affiliated with

Also associated with

No associations

Rating

A Partial Order on Bipartite Graphs with n Vertices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Partial Order on Bipartite Graphs with n Vertices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Partial Order on Bipartite Graphs with n Vertices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-494492