<?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 Bahonar University of Kerman</PublisherName>
				<JournalTitle>Journal of Mahani Mathematical Research</JournalTitle>
				<Issn>2251-7952</Issn>
				<Volume>14</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>01</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>The adjacency dimension of some path related trees</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>369</FirstPage>
			<LastPage>386</LastPage>
			<ELocationID EIdType="pii">4501</ELocationID>
			
<ELocationID EIdType="doi">10.22103/jmmr.2024.22886.1576</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Elham</FirstName>
					<LastName>Hardany</LastName>
<Affiliation>Department of Mathematics, Faculty of Science, Imam Khomeini International University, P.O. Box: 34149-16818, Qazvin, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Ali</FirstName>
					<LastName>Behtoei</LastName>
<Affiliation>Department of Mathematics, Faculty of Science, Imam Khomeini International University, P.O. Box: 34149-16818, Qazvin, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2024</Year>
					<Month>01</Month>
					<Day>30</Day>
				</PubDate>
			</History>
		<Abstract>‎Since the problem of computing the adjacency dimension of a graph is NP-hard‎, ‎finding the adjacency dimension of special classes of graphs or obtaining good bounds on this invariant is valuable‎. ‎In this paper we determine the properties of each adjacency resolving set of paths. ‎Then, ‎by ‎using ‎these ‎properties,‎ we determine the adjacency dimension of broom and double broom graphs‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Adjacency resolving set‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Adjacency dimension‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Path‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Broom‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Tree‎</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jmmrc.uk.ac.ir/article_4501_18f407af7d61bab854c663f671bb11b8.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
