Score sequences of bitournaments

MaRDI QIDQ5087632zbMATH OpenFDO

Authors Servino V. Gervacio

Publication date 1 July 2022

Full work available at URL https://arxiv.org/abs/2102.01337

zbMATH Keywords

oriented graphcomplete graphtournamentcomplete bipartite graphscore sequencebitournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Abstract: 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.

Recommendations

• Score sequences of oriented graphs
• On scores in tournaments
• scientific article; zbMATH DE number 1868915
• scientific article; zbMATH DE number 3904614
• scientific article; zbMATH DE number 1156635

Cited in

(1)

• Tournament Coding of Integer Sequences

This page was built for publication: Score sequences of bitournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087632)