A Study of PageRank in Undirected Graphs

Document Type: Original Scientific Paper

Authors

Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training University, Tehran, Iran

10.22052/mir.2018.125190.1097

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.

Keywords