On the Essential Element Graph of a Lattice

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.

Keywords

• Lattice
• zero-divisor graph
• essential element
• annihilator

References

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.
6. Anderson, D.F., Livingston P.S., The zero-divisor graph of commutative ring, J. Algebra, 217(1999), 434–447.
7. Beck, I., Coloring of commutative rings, J. Algebra, 116(1988), 208–226.
8. Beineke, L.W., Characterizations of derived graphs, J. Comb. Theory, 9(1970), 129–135.

9. Chartrand, G., Zhang, P., Chromatic Graph Theory, Chapman and Hall/CRC, 2008, 298p.
10. Chelvam, T.T., Nithya, S., A note on the zero divisor graph of a lattice, Trans. on Combin., 3(3)(2014), 51–59.
11. Curtis, A.R., Diesl, A.J., Rieck, J.C., Classifying annihilating-ideal graphs of commutative artinian rings, Communications in Algebra, 46(9)(2018), 4131–4147.
12. Davey, B.A., Priestly, H.A., Introduction to Lattices and Order, 2nd, Cambridge University Press, 2002, 312p.
13. Das, A.K., Nongsiang, D., On reduced zero-divisor graphs of posets, Journal of Discrete Mathematics, 2015(2015), 1–7.
14. Krithika, R., Mathew, R., Narayanaswamy, N.S., Sadagopan N., A Dirac-type characterization of k-chordal graphs, Discrete Math., 313(2013), 2865–2867.
15. Lu, D., Wu T., The Zero-divisor graphs of posets and an application to semigroups, Graphs and Combinatorics, 26(2010), 793–804.
16. Nimbhorkar, S., Deshmukh, D., The essential element graph of a lattice, Asian-European J of Math., 13(1)(2020), 1–9.
17. Nimbhokar, S.K., Wasadikar, M.P., Pawar, M.M., Coloring of lattices, Math. Slovaca, 60(2010), 419–434.
18. Nimbhokar, S.K., Vidya, S.D., Incomparability graphs of dismantable lattices , Asian-European J of Math., 13(1)(2020), 1–8.
19. Parsapour, A., Javaheri, K A., The embedding of annihilating-ideal graphs associated to lattices in the projective plane, Bull. Malays. Math. Sci. Soc., 42(2019), 1625–1638.
20. Wasadikar, M., Survase, P., Lattices, whose incomparability graphs have horns, J Discrete Algorithms, 23(2013), 63–75.
21. Xue, Z., Liu, L., Zero-divisor graphs of partially ordered sets, Appl. math. Lett., 23(2010), 449–452.