Join maximal element graph of lattice modules

Sherpa, L.; Kharat, V.; Agalave, M.; Phadatare, N. M.

doi:10.22124/jart.2026.28291.1704

Join maximal element graph of lattice modules

Articles in Press

Document Type : Research Paper

Authors

¹ Department of Mathematics‎,‎ Savitribai Phule Pune University, Pune‎, ‎India

² Department of Mathematics‎,‎ Fergusson College(Autonomus), Pune‎, ‎India

³ Bharati Vidyapeeth Deemed to be University College of Engineering, Pune‎, ‎India

10.22124/jart.2026.28291.1704

Abstract

Let $\pounds$ be a $C$-lattice and $M$ be a lattice module over $\pounds$‎. ‎The join maximal element graph $\mathbb{G}(M)$ is a simple‎, ‎undirected graph with all proper non-zero elements of $M$ as vertices‎, ‎and two distinct vertices‎, ‎$N$ and $K$‎, ‎are adjacent if and only if $N\vee K\in Max(M)$‎, ‎where $Max(M)$ is the collection of all maximal elements of $M$‎. ‎In this paper‎, ‎some properties of the graph $\mathbb{G}(M)$ like diameter‎, ‎girth and clique number are investigated‎. ‎Also‎, ‎the interplay between the algebraic properties of $M$ and the properties of those graphs is studied‎.

Keywords

Main Subjects