On Graphs of Dualities of Bipartite Posets

Abstract

In this paper we introduce some new graphs obtained from
bipartite posets. We show that lower-minimal graph of a bipartite poset
is isomorphic to upper-maximal graph of dual of the poset by using set
representations of the posets.

Keywords

• Poset, Lower-minimal graph, Upper-maximal graph

References

1. Chartrand, G. Isomorphic Graphs, Introductory Graph Theory. New York: Dover,
2. ; pp. 32-40.
3. Gratzer, G. Lattice theory: Foundation, Springer Science and Business Media;
4. , pp. 5-6.
5. Simovici, Dan A.; Djeraba C. Partially Ordered Sets. Mathematical Tools for Data
6. Mining: Set Theory, Partial Orders, Combinatorics. Springer, 2008; pp. 129-172.
7. Skiena, S. Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica ,Cambridge University Press, 2003, pp. 306-316.
8. Steiner, G.; Stewart, L. K. A linear time algorithm to find the jump number of

9. -dimensional bipartite partial orders, Order, 1987, 3(4), 359-367.
10. Civan, Y., Upper maximal graphs of posets, Order, Vol 30:2, 2013, 677-688.