>
Fa   |   Ar   |   En
   a study of pagerank in undirected graphs  
   
نویسنده lotfi abdolah ,ghorbani modjtaba ,mesgarani hamid
منبع mathematics interdisciplinary research - 2019 - دوره : 4 - شماره : 2 - صفحه:157 -169
چکیده    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 computing their pr vectors. in continuing, we provide an ordering of graphs by variance of pr vector whose variation is proportional with variance of degree sequence. finally, we introduce a relation between domination number and pr-variance of given graphs.
کلیدواژه pagerank algorithm ,google matrix ,domination number ,isomorphism
آدرس shahid rajaee teacher training university, faculty of science, department of mathematics, iran, shahid rajaee teacher training university, faculty of science, department of mathematics, iran, shahid rajaee teacher training university, faculty of science, department of mathematics, iran
پست الکترونیکی hmesgarani@srttu.edu, hmesgarani@sru.ac.ir
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved