A Partial Order on Bipartite Graphs with n Vertices
Discrete Mathematics
2009-06-05 v1
Abstract
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.
Keywords
Cite
@article{arxiv.0906.0859,
title = {A Partial Order on Bipartite Graphs with n Vertices},
author = {Emil Daniel Schwab},
journal= {arXiv preprint arXiv:0906.0859},
year = {2009}
}
Comments
10 pages,exposed on 5th International Conference "Actualities and Perspectives on Hardware and Software" - APHS2009, Timisoara, Romania