Counting Various Classes of Tournament Score Sequences
Paul K. Stockmeyer
Department of Computer Science
The College of William & Mary
P. O. Box 8795
Williamsburg, VA 23187-8795
USA
Abstract:
Based on known methods for computing the number of distinct score
sequences for n-vertex tournaments, we develop algorithms for computing
the number of distinct score sequences for self-complementary
tournaments, strong tournaments, and tournaments that are both
self-complementary and strong.
Full version: pdf,
dvi,
ps,
latex
(Concerned with sequences
A000571
A345470
A351822
A351869.)
Received July 20 2022; revised versions received July 21 2022; May 28 2023; May 29 2023.
Published in Journal of Integer Sequences,
May 29 2023.
Return to
Journal of Integer Sequences home page
