<?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>Shahid Rajaee Teacher Training University</PublisherName>
				<JournalTitle>Journal of Discrete Mathematics and Its Applications</JournalTitle>
				<Issn>2981-0809</Issn>
				<Volume>7</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2022</Year>
					<Month>12</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Spectral properties of fullerene graphs</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>195</FirstPage>
			<LastPage>207</LastPage>
			<ELocationID EIdType="pii">2077</ELocationID>
			
<ELocationID EIdType="doi">10.22061/jdma.2023.2077</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Mahin</FirstName>
					<LastName>Songhori</LastName>
<Affiliation>Ministry of Education, Organization for Education and Training, Tehran, I. R. Iran</Affiliation>

</Author>
<Author>
					<FirstName>Mina</FirstName>
					<LastName>Rajabi-Parsa</LastName>
<Affiliation>Lecturer at the Department of Mathematics, Farhangian University, Tehran, I. R. Iran</Affiliation>

</Author>
<Author>
					<FirstName>Razie</FirstName>
					<LastName>Alidehi-Ravandi</LastName>
<Affiliation>Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training University, Tehran, 16785-163, I. R. Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2023</Year>
					<Month>11</Month>
					<Day>01</Day>
				</PubDate>
			</History>
		<Abstract>Fullerenes are polyhedral molecules made of carbon atoms. These graphs have attracted much attention in the chemical and the mathematical literature. In the present paper, we investigate problems concerned with the eigenvalues of fullerene graphs. We obtain new upper bounds for the smallest eigenvalues of fullerenes using bipartite edge-frustration of their related subgraphs.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">fullerene</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">eigenvalue</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">cyclic-$k$-edge cutset</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">quotient graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">bipartite edge frustration</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jdma.sru.ac.ir/article_2077_dcc9b466bf936fbcb63af2d49dd64279.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
