<?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 Kashan</PublisherName>
				<JournalTitle>Mathematics Interdisciplinary Research</JournalTitle>
				<Issn>2538-3639</Issn>
				<Volume>9</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2024</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>On Minimum Algebraic Connectivity of Tricyclic Graphs</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>185</FirstPage>
			<LastPage>197</LastPage>
			<ELocationID EIdType="pii">114327</ELocationID>
			
<ELocationID EIdType="doi">10.22052/mir.2024.253568.1437</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Hassan</FirstName>
					<LastName>Taheri</LastName>
<Affiliation>‎Faculty of Mathematical Science,
 ‎Department of Pure Mathematics,‎
         ‎University of Kashan,‎
       ‎Kashan 87317-51167‎, ‎I. R. Iran</Affiliation>

</Author>
<Author>
					<FirstName>Gholam Hossein</FirstName>
					<LastName>Fath-Tabar</LastName>
<Affiliation>‎Faculty of Mathematical Science,
 ‎Department of Pure Mathematics,‎
         ‎University of Kashan,‎
       ‎Kashan 87317-51167‎, ‎I. R. Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2023</Year>
					<Month>09</Month>
					<Day>25</Day>
				</PubDate>
			</History>
		<Abstract>‎Consider a simple‎, ‎undirected graph $ G=(V,E)$‎, ‎where $A$ represents the adjacency matrix and $Q$ represents the Laplacian matrix of $G$‎. ‎The second smallest eigenvalue of Laplacian matrix of $G$ is called the algebraic connectivity of $G$‎. ‎In this article‎, ‎we present a Python program for studying the Laplacian eigenvalues of a graph‎. ‎Then‎, ‎we determine the unique graph of minimum algebraic connectivity in the set of all tricyclic graphs‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Algebraic connectivity‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Bicyclic graph‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Tricyclic graph‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Python programming language‎</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://mir.kashanu.ac.ir/article_114327_65963fe40f3d819f233406d3954b9d84.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
