In this paper, we generate all nonisomorphic tournaments of order at most nine, all nonisomorphic almost regular tournaments of order 10 and all nonisomorphic regular tournaments 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 the well-known Kelly's Conjecture for n = 2k + 1 < 11. And we also determine the n-universal tournaments for n < 6. However, several related results are given and some related open problems are raised.

In this paper, we generate all nonisomorphic tournaments of order at most nine, all nonisomorphic almost regular tournaments of order 10 and all nonisomorphic regular tournaments 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 the well-known Kelly's Conjecture for n = 2k + 1 < 11. And we also determine the n-universal tournaments for n < 6. However, several related results are given and some related open problems are raised.