<?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 Isfahan</PublisherName>
				<JournalTitle>Transactions on Combinatorics</JournalTitle>
				<Issn>2251-8657</Issn>
				<Volume>8</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2019</Year>
					<Month>03</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>On the zero forcing number of generalized Sierpinski graphs</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>41</FirstPage>
			<LastPage>50</LastPage>
			<ELocationID EIdType="pii">23265</ELocationID>
			
<ELocationID EIdType="doi">10.22108/toc.2018.101107.1463</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Ebrahim</FirstName>
					<LastName>Vatandoost</LastName>
<Affiliation>Imam Khomeini International University</Affiliation>

</Author>
<Author>
					<FirstName>Fatemeh</FirstName>
					<LastName>Ramezani</LastName>
<Affiliation>Yazd University</Affiliation>

</Author>
<Author>
					<FirstName>Saeid</FirstName>
					<LastName>Alikhani</LastName>
<Affiliation>Yazd University‎</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2016</Year>
					<Month>12</Month>
					<Day>17</Day>
				</PubDate>
			</History>
		<Abstract>In this article we study the Zero forcing number of Generalized Sierpi\&#039;{n}ski graphs $S(G,t)$‎. ‎More precisely‎, ‎we obtain a general lower bound on the Zero forcing number of $S(G,t)$ and we show that this bound is tight‎. ‎In particular‎, ‎we consider the cases in which the base graph $G$ is a star‎, ‎path‎, ‎a cycle or a complete graph‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">‎Zero forcing number‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎generalized Sierpi'{n}ski graph‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Sierpi'{n}ski graph‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎path covering</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://toc.ui.ac.ir/article_23265_e768f70fa89d95c17111a4dc08270b06.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
