On isomorphic, nonisomorphic and the number of tournaments from three tournament construction algorithms

• Main Author: Alvarez, Ryan T.
• Format: text
• Language: English
• Published: Animo Repository 1999
• Subjects: Graph theory; Algorithms; Isomorphism (Mathematics); Mathematics
• Online Access: https://animorepository.dlsu.edu.ph/etd_masteral/2026
• Institution: De La Salle University

A tournament T of order n is a digraph V(T), A(T) with vertex-set V(T)=&1,2,...,n such that for every pair of distinct vertices i and j in V(T), (i,j) element A(T) or (j,i) element A(T) but not both. The score Si of a vertex i element V(T) is the number of arcs (i,j) element A(T). In this thesis...