• DOI:10.1016/j.ipl.2015.02.015
Corpus ID: 9855132

A note on the PageRank of undirected graphs

@article{Grolmusz2015ANO,
  title={A note on the PageRank of undirected graphs},
  author={V. Grolmusz},
  journal={Inf. Process. Lett.},
  year={2015},
  volume={115},
  pages={633-634}
}

V. Grolmusz

Published 2015

Computer Science, Mathematics

Inf. Process. Lett.

The PageRank is a widely used scoring function of networks in general and of the World Wide Web graph in particular. The PageRank is defined for directed graphs, but in some special cases applications for undirected graphs occur. In the literature it is widely - but not exclusively - noted that the PageRank for undirected graphs is proportional to the degrees of the vertices of the graph. We prove that statement for a particular personalization vector in the definition of the PageRank, and we… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed