<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>University of Guilan</PublisherName>
				<JournalTitle>Journal of Algebra and Related Topics</JournalTitle>
				<Issn>2345-3931</Issn>
				<Volume>14</Volume>
				<Issue>Special Issue- Dedicated to the memory of Jürgen Herzog (1941-2024).</Issue>
				<PubDate PubStatus="epublish">
					<Year>2026</Year>
					<Month>04</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Join maximal element graph of lattice modules</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>115</FirstPage>
			<LastPage>123</LastPage>
			<ELocationID EIdType="pii">9431</ELocationID>
			
<ELocationID EIdType="doi">10.22124/jart.2026.28291.1704</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>L.</FirstName>
					<LastName>Sherpa</LastName>
<Affiliation>Department of Mathematics‎,‎ Savitribai Phule Pune University, Pune‎, ‎India</Affiliation>

</Author>
<Author>
					<FirstName>V.</FirstName>
					<LastName>Kharat</LastName>
<Affiliation>Department of Mathematics‎,‎ Savitribai Phule Pune University, Pune‎, ‎India</Affiliation>

</Author>
<Author>
					<FirstName>M.</FirstName>
					<LastName>Agalave</LastName>
<Affiliation>Department of Mathematics‎,‎ Fergusson College(Autonomus), Pune‎, ‎India</Affiliation>

</Author>
<Author>
					<FirstName>N. M.</FirstName>
					<LastName>Phadatare</LastName>
<Affiliation>Bharati Vidyapeeth Deemed to be University College of Engineering, Pune‎, ‎India</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2024</Year>
					<Month>08</Month>
					<Day>27</Day>
				</PubDate>
			</History>
		<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‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">‎Maximal element</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Jacobson radical $J_{rad}(M)$</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Join maximal element graph $\mathbb{G}(M)$</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jart.guilan.ac.ir/article_9431_70964bf3a60bb5a4ff35d04635a81402.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
