<abstract xmlns="http://www.w3.org/1999/xhtml"><p>A tournament is an orientation of a complete simple graph. The score of a vertex in a tournament is the outdegree of the vertex. In this paper, we obtain various results on the scores in tournaments.</p></abstract>

A tournament is an orientation of a complete simple graph. The score of a vertex in a tournament is the outdegree of the vertex. In this paper, we obtain various results on the scores in tournaments.

On scores in tournaments

Acta Universitatis Sapientiae, Informatica

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

{"article-title":"On scores in tournaments"}

A tournament is an orientation of a complete simple graph. The score of a vertex in a tournament is the outdegree of the vertex. In this paper, we obtain...

On scores in tournaments

Pubblicato online: 31 dic 2018

Pagine: 257 - 267

Ricevuto: 18 nov 2018

DOI: https://doi.org/10.2478/ausi-2018-0013

Parole chiave
Tournament, score, score sequence, Landau’s theorem

© 2018 T. A. Naikoo, published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

On scores in tournaments

Pubblicato online: 31 dic 2018

Pagine: 257 - 267

Ricevuto: 18 nov 2018

DOI: https://doi.org/10.2478/ausi-2018-0013

Parole chiaveTournament, score, score sequence, Landau’s theorem

© 2018 T. A. Naikoo, published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Parole chiave
Tournament, score, score sequence, Landau’s theorem