Ranking by Outdegree for Directed Graphs

J.R. van den Brink, R.P. Gilles

    Research output: Contribution to JournalArticleAcademic


    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). © 2003 Elsevier B.V. All rights reserved.
    Original languageEnglish
    Pages (from-to)261-270
    Number of pages9
    JournalDiscrete Mathematics
    Publication statusPublished - 2003


    Dive into the research topics of 'Ranking by Outdegree for Directed Graphs'. Together they form a unique fingerprint.

    Cite this