Prime O-ideals of distributive lattices
Journal: International Journal of Mathematics and Soft Computing (Vol.2, No. 1)Publication Date: 2012-01-29
Authors : M. Sambasiva Rao;
Page : 1-8
Keywords : Prime O-ideal; filter; annihilator ideal; *-lattice; co-maximality.;
Abstract
In this paper we derive some sufficient conditions for a prime ideal of a distributive lattice to become an O-ideal. A set of equivalent conditions are established for every O-ideal to become an annihilator ideal. An equivalency is obtained between prime O-ideals and minimal prime ideals of a distributive lattice. Finally, the concept of co-maximality is introduced and obtained that any two distinct prime O-ideals of a distributive lattice are co-maximal.
Other Latest Articles
- Skolem difference mean labeling of H-graphs
- Cordial labeling for the splitting graph of some standard graphs
- Directed edge - graceful labeling of cycle and star related graphs
- Extended results on two domination number and chromatic number of a graph
- Equality of strong domination and chromatic strong domination in graphs
Last modified: 2013-08-24 01:40:29