Score sequences of bitournaments

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteur principal: Gervacio, Severino V.
Format: Preprint
Publié: 2021
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866910744024449024
author Gervacio, Severino V.
author_facet Gervacio, Severino V.
contents The score of a vertex $x$ in an oriented graph is defined to be its outdegree, \emph{i.e.}, the number of arcs with initial vertex $x$. The score sequence of an oriented graph is the sequence of all scores arranged in nondecreasing order. An oriented complete bipartite graph is called a bitournament. The score sequence of a bitournament consists of two nondecreasing sequences of nonnegative integers, one for each of the two partite sets. Moon has characterized the score sequences of bitournaments. This paper introduces the concept of trimming a sequence and gives a characterization of score sequences of bitournaments utilizing this concept.
format Preprint
id arxiv_https___arxiv_org_abs_2102_01337
institution arXiv
publishDate 2021
record_format arxiv
spellingShingle Score sequences of bitournaments
Gervacio, Severino V.
Combinatorics
05C20
G.2
The score of a vertex $x$ in an oriented graph is defined to be its outdegree, \emph{i.e.}, the number of arcs with initial vertex $x$. The score sequence of an oriented graph is the sequence of all scores arranged in nondecreasing order. An oriented complete bipartite graph is called a bitournament. The score sequence of a bitournament consists of two nondecreasing sequences of nonnegative integers, one for each of the two partite sets. Moon has characterized the score sequences of bitournaments. This paper introduces the concept of trimming a sequence and gives a characterization of score sequences of bitournaments utilizing this concept.
title Score sequences of bitournaments
topic Combinatorics
05C20
G.2
url https://arxiv.org/abs/2102.01337