<?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>Azarbaijan Shahid Madani University</PublisherName>
				<JournalTitle>Communications in Combinatorics and Optimization</JournalTitle>
				<Issn>2538-2128</Issn>
				<Volume></Volume>
				<Issue>Articles in Press</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>10</Month>
					<Day>17</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Join standard graph of a lattice</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">15031</ELocationID>
			
<ELocationID EIdType="doi">10.22049/cco.2025.30680.2577</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>N Aishwarya</FirstName>
					<LastName>Nayak</LastName>
<Affiliation>Department of Mathematics, Manipal Institute of Technology, Manipal Academy of Higher
Education, Manipal, India</Affiliation>

</Author>
<Author>
					<FirstName>Pallavi</FirstName>
					<LastName>P</LastName>
<Affiliation>Department of Mathematics, Manipal Institute of Technology Bengaluru, Manipal Academy of
Higher Education, Manipal, India</Affiliation>

</Author>
<Author>
					<FirstName>Syam Prasad</FirstName>
					<LastName>Kuncham</LastName>
<Affiliation>Department of Mathematics, Manipal Institute of Technology, Manipal Academy of Higher
Education, Manipal, India</Affiliation>

</Author>
<Author>
					<FirstName>Tapatee</FirstName>
					<LastName>S</LastName>
<Affiliation>Department of Mathematics, Manipal Institute of Technology Bengaluru, Manipal Academy of
Higher Education, Manipal, India</Affiliation>

</Author>
<Author>
					<FirstName>Harikrishnan</FirstName>
					<LastName>P K</LastName>
<Affiliation>Department of Mathematics, Manipal Institute of Technology, Manipal Academy of Higher
Education, Manipal, India</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</History>
		<Abstract>In this paper, we introduce and investigate the join standard graph $G_S(L)$ of a finite lattice $L$. We explore structural properties of the graph such as connectedness, girth, and provide necessary and sufficient conditions for the existence of universal and isolated vertices. We show that a lattice homomorphism $\varphi$ from $L_1$ to $L_2$ induces a graph homomorphism between $G_S(L_1)$ and $G_S(L_2)$. We further analyze the relationship between the graph of a lattice product and the product of graphs of its constituent lattices. Subsequently, we establish a condition under which the graph becomes hypertriangulated. We prove that the graph $G_S(L)$ is complemented if and only if the underlying lattice has cardinality at most two. Finally, we provide a criterion under which the subgraph $G_S(L)-1$ becomes disconnected.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">standard element</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Lattice</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Cartesian product</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">totally disconnected</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://comb-opt.azaruniv.ac.ir/article_15031_c1638e5c815b3177fa7afcf5a455d80d.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
