Title of article :
Ranking by outdegree for directed graphs Original Research Article
Author/Authors :
René van den Brink، نويسنده , , Robert P. Gilles، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2003
Abstract :
A ranking method assigns to every directed graph a (weak) ordering of the nodes. In this paper, we axiomatize the ranking method that ranks the nodes according to their outdegree. This method generalizes the ranking by Copeland score for tournaments as characterized in Rubinstein (SIAM J. Appl. Math. 38 (1980) 108–111).
Keywords :
Directed graphs , Outdegree , Copeland score , Ranking method
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
