Distributive Lattice Under S-accessibility

Madhu Tiwari¹ , Namrata Kaushal² , Nidhi Asthana³ , C.L.Parihar ⁴

Section:Research Paper, Product Type: Isroset-Journal
Vol.2 , Issue.1 , pp.1-3, Feb-2015

Online published on Jan 29, 2015

Copyright © Madhu Tiwari, Namrata Kaushal, Nidhi Asthana , C.L.Parihar . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
 

View this paper at   Google Scholar | DPI Digital Library

XML View     PDF Download

How to Cite this Paper

Abstract :
If we starts with an acyclic orientation and prohibited flipping and flopping to a simple vertex it ends eventually with an orientation and another orientation is accessible from it then one can show that the set of such orientations of a graph with a given flip-flop can be made it to distributive lattice under s-accessibility. Set of orientations of connected finite graph shows that, any two such orientations having same flow difference around all closed loops has obtained from one another by succession of local moves of a simple type .In this paper simple connected graph with n ˃ 1 vertices has been taken and distributivity in set of orientations under s-accessibility will be proved.

Key-Words / Index Term :
Acyclic orientations, Flip-Flop, s-accessibility

References :
[1] Demendez, O. P. “Orientations bipolaires”, PhD Thesis, Paris (1994).
[2] Felsner. S., “Convex drawing of planer graphs and the order dimension of 3-polytopes orders”, 18, 19-37, (2001).
[3] Felsner, S., “Lattice Structures from Planer Graphs”, Elector J. Combin, 11, 15-24, (2004).
[4] Felsner, S., Kolja, B., Knauer, “Distributive Lattices Polyhedral and Generalized Flow”, Technical University, Berlin (2002).
[5] Fukuda, K., Prodon, A., Sakuma, T., “Notes on acyclic orientations and the shelling lemma Theory of Computer Science”, 263, 9-16, (2001).
[6] Kolja, B., Knauer, “Distributive Lattices on Graph Orientations, Technical University Berlin (2000).
[7] Latapy. M., Magnien, c., “Coding distributive lattice with edge firing games” Inform. Process Lett.83 (2000) 125-128.
[8] Liu, W.P., Rival,I., “Inversions, Cuts and orientations” Discrete Math.87(1991) 163-174.
[9] Pretzel. O., “Orientations and reorientations of graphs: Combinatorics and Ordered Sets”,Contemp. Math. 57, 103-125,
[10] Propps, J., “Lattice structure for orientation of graphs”, (1993).
[11] Pretzel, O., “On reoeientating graphs by pushing down maximal vertices order” 3, 135-153 (1986).