Ranking by outdegree for directed graphs

DOI10.1016/S0012-365X(03)00050-5zbMath1021.05042MaRDI QIDQ1408881

Robert P. Gilles, René van den Brink

Publication date: 25 September 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00050-5

zbMATH Keywords

directed graphs; outdegree; ranking method; Copeland score

Mathematics Subject Classification ID

91B08: Individual preferences

05C20: Directed graphs (digraphs), tournaments

Related Items

On Different Ranking Methods, Some Impossibilities of Ranking in Generalized Tournaments, Centrality measures in networks, The outflow ranking method for weighted directed graphs, A characterization of the Copeland solution, Evolvement of influence in hierarchies, The degree ratio ranking method for directed graphs, Axiomatizations of the \(\beta\) and the score measures in networks, Erratum to: ``Ranking by outdegree for directed graphs, The degree measure as utility function over positions in graphs and digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cyclic tournaments and cooperative majority voting: A solution
• The Copeland choice function. An axiomatic characterization
• Ranking methods based on valued preference relations. A characterization of the net flow method
• Ranking the Participants in a Tournament