<?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>3</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2018</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Some Applications of Strong Product</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>55</FirstPage>
			<LastPage>65</LastPage>
			<ELocationID EIdType="pii">63360</ELocationID>
			
<ELocationID EIdType="doi">10.22052/mir.2018.55115.1033</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Mostafa</FirstName>
					<LastName>Tavakoli</LastName>
<Affiliation>Department of Applied Mathematics
Ferdowsi University of Mashhad
P. O. Box 1159, Mashhad 91775, I. R. Iran</Affiliation>

</Author>
<Author>
					<FirstName>Freydoon</FirstName>
					<LastName>Rahbarnia</LastName>
<Affiliation>Department of Applied Mathematics
Ferdowsi University of Mashhad
P. O. Box 1159, Mashhad 91775, I. R. Iran</Affiliation>

</Author>
<Author>
					<FirstName>Irandokht</FirstName>
					<LastName>Rezaee Abdolhosein Zadeh</LastName>
<Affiliation>Department of Applied Mathematics
Ferdowsi University of Mashhad
P. O. Box 1159, Mashhad 91775, I. R. Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2016</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</History>
		<Abstract>Let G and H be graphs. The strong product GH of graphs G and H is the graph with vertex set V(G)V(H) and u=(u&lt;sub&gt;1&lt;/sub&gt;, v&lt;sub&gt;1&lt;/sub&gt;) is adjacent with v= (u&lt;sub&gt;2&lt;/sub&gt;, v&lt;sub&gt;2&lt;/sub&gt;) whenever (v&lt;sub&gt;1&lt;/sub&gt; = v&lt;sub&gt;2&lt;/sub&gt; and u1 is adjacent with u&lt;sub&gt;2&lt;/sub&gt;) or (u&lt;sub&gt;1&lt;/sub&gt; = u&lt;sub&gt;2 &lt;/sub&gt;and v&lt;sub&gt;1&lt;/sub&gt; is adjacent with v&lt;sub&gt;2&lt;/sub&gt;) or (u1 is adjacent with u&lt;sub&gt;2&lt;/sub&gt; and v&lt;sub&gt;1&lt;/sub&gt; is adjacent with v&lt;sub&gt;2&lt;/sub&gt;). In this paper, we ﬁrst collect the earlier results about strong product and then we present applications of these results in working with some important graphs&lt;br /&gt;such as Fence graphs.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">strong product</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">graph invariant</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">topological index</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://mir.kashanu.ac.ir/article_63360_ddabf90a24b0b6b016f20ecb8f28d726.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
