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

• المؤلف الرئيسي: Alvarez, Ryan T.
• التنسيق: text
• اللغة: English
• منشور في: Animo Repository 1999
• الموضوعات: Graph theory; Algorithms; Isomorphism (Mathematics); Mathematics
• الوصول للمادة أونلاين: https://animorepository.dlsu.edu.ph/etd_masteral/2026

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