<?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>4</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2019</Year>
					<Month>12</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A Study of PageRank in Undirected Graphs</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>157</FirstPage>
			<LastPage>169</LastPage>
			<ELocationID EIdType="pii">100994</ELocationID>
			
<ELocationID EIdType="doi">10.22052/mir.2018.125190.1097</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Abdollah</FirstName>
					<LastName>Lotfi</LastName>
<Affiliation>Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training University, Tehran, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Modjtaba</FirstName>
					<LastName>Ghorbani</LastName>
<Affiliation>Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training University, Tehran, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Hamid</FirstName>
					<LastName>Mesgarani</LastName>
<Affiliation>Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training University, Tehran, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2018</Year>
					<Month>03</Month>
					<Day>16</Day>
				</PubDate>
			</History>
		<Abstract>The PageRank (PR) algorithm is the base of Google search engine. In this paper, we study the PageRank sequence for undirected graphs of order six by PR vector. Then, we provide an ordering for graphs by variance of PR vector which it’s variation is proportional with variance of degree sequence. Finally, we introduce a relation between domination number and PR-variance of graphs.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">PageRank algorithm</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">google matrix</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Domination number</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">isomorphism</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://mir.kashanu.ac.ir/article_100994_4a176ba385e4ccacb68137f1ffe36250.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
