<?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>10</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Laplacian‎ ‎Coefficients of a‎ ‎Forest in Terms of the Number of Closed Walks in the Forest and its Line Graph</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>133</FirstPage>
			<LastPage>143</LastPage>
			<ELocationID EIdType="pii">114890</ELocationID>
			
<ELocationID EIdType="doi">10.22052/mir.2024.255007.1467</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Ali</FirstName>
					<LastName>Ghalavand</LastName>
<Affiliation>‎Department of Pure Mathematics,
 ‎Faculty of Mathematical Sciences,
  ‎University of Kashan,
    ‎Kashan‎, ‎I‎. ‎R‎. ‎Iran</Affiliation>

</Author>
<Author>
					<FirstName>Alireza</FirstName>
					<LastName>Ashrafi</LastName>
<Affiliation>‎Department of Pure Mathematics,
 ‎Faculty of Mathematical Sciences,
  ‎University of Kashan,
    ‎Kashan‎, ‎I‎. ‎R‎. ‎Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2024</Year>
					<Month>06</Month>
					<Day>05</Day>
				</PubDate>
			</History>
		<Abstract>‎In this paper‎, ‎we deal with calculating the laplacian coefficients of a finite simple graph $G$ with the Laplacian polynomial $\psi(G,\lambda) = \sum_{k=0}^{n}(-1)^{n-k}c_k\lambda^k$‎. ‎We also explore the relationship between the number of closed walks in a graph and a series of its line graphs with the Laplacian coefficients‎. ‎Our objective is to find a way to determine the Laplacian coefficients using the number of closed walks in a graph and its line graph‎. ‎Specifically‎, ‎we have derived the Laplacian coefficients $c_{n-k}$ of a forest $F$ (where $1 \leq k \leq 6$) in terms of the number of closed walks in $F$ and its line graph‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Forest‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Laplacian coefficient‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Closed walk</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://mir.kashanu.ac.ir/article_114890_4086ca2b1bbd37b77e9cca3d4e7d2f73.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
