In this paper, we generate all nonisomorphic tournaments of order at mostnine, all nonisomorphic almost regular tournaments of order 10 and all nonisomorphic regulartournaments of order 11. For each of these tournamen...In this paper, we generate all nonisomorphic tournaments of order at mostnine, all nonisomorphic almost regular tournaments of order 10 and all nonisomorphic regulartournaments of order 11. For each of these tournaments, we have given its score-list, connectivity,diameter, the minimal number of feedbacks, automorphisms and spectra. Moreover, we have verified thewell-known Kelly's Conjecture for n = 2k + 1 ≤ 11. And we also determine the n-universaltournaments for n ≤ 6. However, several related results are given and some related open problemsare raised.展开更多
文摘In this paper, we generate all nonisomorphic tournaments of order at mostnine, all nonisomorphic almost regular tournaments of order 10 and all nonisomorphic regulartournaments of order 11. For each of these tournaments, we have given its score-list, connectivity,diameter, the minimal number of feedbacks, automorphisms and spectra. Moreover, we have verified thewell-known Kelly's Conjecture for n = 2k + 1 ≤ 11. And we also determine the n-universaltournaments for n ≤ 6. However, several related results are given and some related open problemsare raised.
