Semi-complement graph of lattice modules
Let L be a C-lattice and M be a lattice module over L. In this paper, we introduce the semi-complement graph of M denoted by \(\Gamma (M)\) that is the undirected graph with all semi-complement elements of M as a vertex set, and two vertices X and Y are adjacent if and only if \(X\vee Y\) is a semi-complement element. In this paper, we investigate some properties of \(\Gamma (M)\) under some condition on M. For instance, we characterize non-connected graph \(\Gamma (M)\) of a principally generated comultiplication lattice module M over a C-lattice L.
KeywordsMinimal element Second element Semi-complement element
We would like to thank Dr. Rupesh Shewale and Mr N.M. Shaikh for their suggestions for preparation of the present paper. The authors are very much thankful to the referee for valuable guidance.
Compliance with ethical standards:
Conflict of interest
The authors declare that there is no conflict of interests regarding the publishing of this paper.
This article does not contain any studies with human participants or animals performed by any of the authors.
- Ballal S, Kharat V (2015) Zariski topology on lattice modules. Asian-Eur J Math 8: 1550066 (10 pages). 1142/S1793557115500667Google Scholar
- Ballal S, Kharat V (2015) On \(\phi \)-absorbing primary elements in lattice modules. Algebra Volume 2015, Article ID 183930: 6 pages. https://doi.org/10.1155/2015/183930