Affiliation:
1. Ağrı İbrahim Çeçen University
Abstract
Let $\mathcal{L}$ be a bounded lattice. The essential element graph of $\mathcal{L}$ is a simple undirected graph $\varepsilon_{\mathcal{L}}$ such that the elements $x,y$ of $\mathcal{L}$ form an edge in $\varepsilon_{\mathcal{L}}$, whenever $x \vee y $ is an essential element of $\mathcal{L}$. In this paper, we study properties of the essential elements of lattices and essential element graphs. We study the lattices whose zero-divisor graphs and incomparability graphs are isomorphic to its essential element graphs. Moreover, the line essential element graphs are investigated.
Publisher
Turkish Journal of Mathematics and Computer Science, Association of Mathematicians
Reference21 articles.
1. Afkhami, M., Barati, Z., Khashyarmanesh, K., Planar zero-divisor graphs of partially ordered sets, Acta Math. Hungar., 137(2012), 27–35.
2. Afkhami, M., Khashyarmanesh, K., The comaximal graph of a lattice, Bull. Malays. Math. Sci. Soc., 37(1)(2014), 261–269.
3. Afkhami, M., Barati Z., Khashyarmanesh, K., A graph associated to a lattice , Ricerche Mat., 63(2014), 67–78.
4. Akbari, S., Alilou, A., Amjadi J., Sheikholeslami, S.M., The co-annihilating-ideal graphs of commutative rings, Canad. Math. Bull., 60(2017), 3–11.
5. Albu, T., Iosif, M., Modular C11 lattices and lattice preradicals, Journal of Algebra and Its Applications, 16(5)(2017), 1–19.