<?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>3</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2015</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Line graphs associated to the maximal graph</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>1</FirstPage>
			<LastPage>11</LastPage>
			<ELocationID EIdType="pii">1209</ELocationID>
			
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>A.</FirstName>
					<LastName>Sharma</LastName>
<Affiliation>University of Delhi</Affiliation>

</Author>
<Author>
					<FirstName>A.</FirstName>
					<LastName>Gaur</LastName>
<Affiliation>University of Delhi</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2015</Year>
					<Month>02</Month>
					<Day>17</Day>
				</PubDate>
			</History>
		<Abstract>Let $R$ be a commutative ring with identity. Let $G(R)$ denote the maximal graph associated to $R$, i.e., $G(R)$ is a graph with vertices as the elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $R$ containing both. Let $\Gamma(R)$ denote the restriction of $G(R)$ to non-unit elements of $R$. In this paper we study the various graphical properties of the line graph associated to $\Gamma(R)$, denoted by $(\Gamma(R))$ such that diameter, completeness, and Eulerian property. A complete characterization of rings is given for which $diam(L(\Gamma(R)))= diam(\Gamma(R))$ or $diam(L(\Gamma(R)))&lt; diam(\Gamma(R))$ or $diam((\Gamma(R)))&gt; diam(\Gamma(R))$. We have shown that the complement of the maximal graph $G(R)$, i.e., the comaximal graph is a Euler graph if and only if $R$ has odd cardinality. We also discuss the Eulerian property of the line graph associated to the comaximal graph.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Maximal graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">line graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">eulerian graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">comaximal graph</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jart.guilan.ac.ir/article_1209_6febd2a7a22b03870dcd02ddde00b032.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
